why is my Sieve of Eratosthenes program so slow?

Question

why my code in Sieve of Eratosthenes is so slow but this one is so fast? they both have same logic. my code:

def sumPrimes(n):
sum, sieve = 0, [True] * n
for