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 23:54Victor MerckléVictor MerckléScore: 38,651Success
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 23:5738,63442,065,96433,998,000024,576stderr
2Sep 2, 2026 23:5738,63842,797,96934,002,000024,576stderr
3Sep 2, 2026 23:5738,64342,553,93034,006,000024,576stderr
4Sep 2, 2026 23:5738,64742,817,24334,010,000024,576stderr
5Sep 2, 2026 23:5738,65142,753,20134,013,000024,576stderr
6Sep 2, 2026 23:5738,65642,824,46934,018,000024,576stderr
7Sep 2, 2026 23:5738,67542,071,57134,034,000024,576stderr
8Sep 2, 2026 23:5738,70042,759,12734,056,000024,576stderr
9Sep 2, 2026 23:5738,71542,159,46734,070,000024,576stderr