Project Euler任务#10 Python错误答案

def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

def sum_of_primes(limit):
    sum = 0
    for i in range(2, limit):
        if is_prime(i):
            sum += i
    return sum

print(sum_of_primes(2000000))

def sum_of_primes(limit):
    is_prime = [True] * limit
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(limit**0.5) + 1):
        if is_prime[i]:
            for j in range(i*i, limit, i):
                is_prime[j] = False
    return sum(i for i, prime in enumerate(is_prime) if prime)

print(sum_of_primes(2000000))