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 18:40Victor MerckléVictor MerckléScore: 2,896Success
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 18:442,86210,739,3872,519,000024,576stderr
2Sep 2, 2026 18:442,86510,732,0702,522,000024,576stderr
3Sep 2, 2026 18:442,87510,677,2172,530,000024,576stderr
4Sep 2, 2026 18:442,88210,644,4622,537,000024,576stderr
5Sep 2, 2026 18:442,89610,722,0852,549,000024,576stderr
6Sep 2, 2026 18:442,97119,469,6582,615,000024,576stderr
7Sep 2, 2026 18:442,98418,392,7282,626,000024,576stderr
8Sep 2, 2026 18:442,98420,619,6342,626,000024,576stderr
9Sep 2, 2026 18:443,01520,011,2632,654,000024,576stderr