fork(1) download
copy 
  1. import math
  2. import functools
  3.  
  4. plist=lambda maxn:functools.reduce(lambda primes,n:(primes.append(n) if (lambda n:all(n%p!=0 for p in primes[:(lambda s:primes.index(next(p for p in primes if p>s)))(int(math.sqrt(n)))]))(n) else None,primes)[1],range(3,maxn+1),[2])
  5.  
  6. primes=plist(19)
  7. print(primes)
  8. print(sum(primes))
  9.  
Success #stdin #stdout 0.02s 9052KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
[2, 3, 5, 7, 11, 13, 17, 19]
77
https://ideone.com/0y7dN9
language:
Python 3 (python  3.9.5)
created:
4 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!