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 listSep 2, 2026 00:03Victor MerckléVictor MerckléScore: 5,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 00:055,19514,049,2864,572,00002,117,632stderr
2Sep 2, 2026 00:055,20012,876,3894,576,00002,117,632stderr
3Sep 2, 2026 00:055,20213,758,6274,578,00002,117,632stderr
4Sep 2, 2026 00:055,20512,962,9154,581,00002,117,632stderr
5Sep 2, 2026 00:055,21112,862,4804,586,00002,117,632stderr
6Sep 2, 2026 00:055,28113,440,8914,648,00002,117,632stderr
7Sep 2, 2026 00:055,28812,823,7284,654,00002,117,632stderr
8Sep 2, 2026 00:055,29413,535,1844,659,00002,117,632stderr
9Sep 2, 2026 00:055,31813,022,5084,680,00002,117,632stderr