Sum of prime numbers Andrey Tsvetkov

Compute the sum of all prime numbers in a stream of binary integers as fast as possible.

Input: 1 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of all values that are prime, printed as a decimal string.

Back to listAug 17, 2026 10:27Tomislav TunkovicTomislav TunkovicScore: 6,039Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 10:345,75914,558,3703,912,0001,156,00081,920
2Aug 17, 2026 10:345,78014,450,3043,863,0001,224,00040,960
3Aug 17, 2026 10:345,78914,860,4244,039,0001,056,00040,960
4Aug 17, 2026 10:346,03114,749,6234,252,0001,056,00040,960
5Aug 17, 2026 10:346,03915,094,0564,121,0001,194,00040,960
6Aug 17, 2026 10:346,06514,739,2164,202,0001,136,00040,960
7Aug 17, 2026 10:346,06914,776,4914,281,0001,060,00086,016
8Aug 17, 2026 10:346,26914,887,3024,452,0001,065,00081,920
9Aug 17, 2026 10:346,34814,965,6324,336,0001,251,00040,960