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 listMay 21, 2026 23:54Josu San MartinJosu San MartinScore: 53,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 23:5752,86257,528,75545,475,0001,044,0002,113,536
2May 21, 2026 23:5752,96358,529,45845,602,0001,006,0002,113,536
3May 21, 2026 23:5752,97656,581,42845,559,0001,060,0002,113,536
4May 21, 2026 23:5753,00158,818,40745,583,0001,058,0002,113,536
5May 21, 2026 23:5753,01357,748,50045,589,0001,063,0002,113,536
6May 21, 2026 23:5753,07557,607,23645,700,0001,006,0002,113,536
7May 21, 2026 23:5753,16158,481,68545,731,0001,051,0002,113,536
8May 21, 2026 23:5753,18157,628,29345,796,0001,004,0002,113,536
9May 21, 2026 23:5753,45556,739,31446,032,0001,009,0002,113,536