Euler problem #10, sum of primes <2000000

[jmark@www ~]$ python sumofprimes.py
Sun Aug 31 11:36:05 2008
142913828922 Sun Aug 31 11:36:46 2008
[jmark@www ~]$ cat sumofprimes.py
import time
print time.asctime()
primes = []
r = range(2,2000000)
while r[0] < 1415:
primes = primes +[r[0]]
r = filter(lambda n: (n %r[0]) > 0, r)
print sum(r) + sum(primes), time.asctime()