fork download
copy 
  1. # sum of the primes less than n
  2.  
  3. def sumPrimes(n):
  4.     sum, sieve = 0, [True] * (n+1)
  5.     for p in range(2, n):
  6.         if sieve[p]:
  7.             sum += p
  8.             for i in range(p*p, n, p):
  9.                 sieve[i] = False
  10.     return sum
  11.  
  12. print sumPrimes(2000000)
Success #stdin #stdout 1.28s 8848KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
142913828922
https://ideone.com/w8MJiA
language:
Python (cpython 2.7.16)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!