fork(2) download
copy 
  1. from datetime import datetime
  2.  
  3. def primes(n):
  4.     """ Returns  a list of primes < n """
  5.     sieve = [True] * n
  6.     for i in xrange(3,int(n**0.5)+1,2):
  7.         if sieve[i]:
  8.             sieve[i*i::2*i]=[False]*((n-i*i-1)/(2*i)+1)
  9.     return [2] + [i for i in xrange(3,n,2) if sieve[i]]
  10.  
  11. d1=datetime.now()
  12.  
  13. print sum(primes(2000000+1))
  14.  
  15. print "Wykonano w czasie: ",datetime.now()-d1
Success #stdin #stdout 0.17s 8328KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
142913828922
Wykonano w czasie:  0:00:00.163190
https://ideone.com/R44fCd
language:
Python (cpython 2.7.16)
created:
10 years ago
visibility:
secret

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!