project euler problem 10

pe10.py

#project euler problem 10
#auther @iizukak

#Sieve of Eratosthenes
#Find primes under n

def sieve(n):
    primes = []
    table = [0 for i in range(n+1)]
    for i in range(2, n+1):
        if table[i] == 0:
            primes.append(i)
            j = 2 
            while(i * j <= n):
                table[i * j] = table[i * j] + 1
                j = j + 1 
    return primes

print(sum(sieve(2000000)))