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 21:44Victor MerckléVictor MerckléScore: 2,781Success
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 21:472,76310,656,0642,432,000024,576stderr
2Sep 2, 2026 21:472,77010,747,5232,438,000024,576stderr
3Sep 2, 2026 21:472,77510,579,9412,442,000024,576stderr
4Sep 2, 2026 21:472,77610,625,6192,443,000024,576stderr
5Sep 2, 2026 21:472,78110,573,5952,448,000024,576stderr
6Sep 2, 2026 21:472,79410,811,7072,459,000024,576stderr
7Sep 2, 2026 21:472,79611,233,5172,461,000024,576stderr
8Sep 2, 2026 21:472,79610,675,3312,461,000024,576stderr
9Sep 2, 2026 21:472,79812,073,6082,463,000024,576stderr