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 15, 2026 19:13Tomislav TunkovicTomislav TunkovicScore: 2,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 19:152,70210,515,7742,378,000020,480
2Aug 15, 2026 19:152,70910,553,0032,384,000020,480
3Aug 15, 2026 19:152,71310,487,8372,388,000020,480
4Aug 15, 2026 19:152,72010,600,8612,394,000020,480
5Aug 15, 2026 19:152,72110,556,1202,395,000020,480
6Aug 15, 2026 19:152,72710,504,6022,400,000020,480
7Aug 15, 2026 19:152,73010,918,3192,403,000020,480
8Aug 15, 2026 19:152,74810,555,6412,419,000020,480
9Aug 15, 2026 19:152,76010,807,3112,429,000020,480