User talk:Monochromeninja

Help on Project Euler problem 10 implementation

The following is my implementation of Project Euler Problem 10 in Python. It seems that it is incorrect, could you please fix it?

primes=[]
sieve=[0]*2000005
for i in range(2,2000000):
    if not sieve[i]:
        primes.append(i)
    for j in primes:
        if j*i>=2000000:
            break
        sieve[j*i]=1
        if not i%j:
            break
print(sum(primes))