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 listJul 6, 2026 04:02Victor MerckléVictor MerckléScore: 4,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 04:053,94311,301,2683,470,00002,117,632stderr
2Jul 6, 2026 04:053,94511,250,7613,472,00002,117,632stderr
3Jul 6, 2026 04:053,97811,324,2933,501,00002,117,632stderr
4Jul 6, 2026 04:054,03011,318,6293,547,00002,117,632stderr
5Jul 6, 2026 04:054,03211,380,2443,549,00002,117,632stderr
6Jul 6, 2026 04:054,04311,609,9613,558,00002,117,632stderr
7Jul 6, 2026 04:054,06011,746,9353,573,00002,117,632stderr
8Jul 6, 2026 04:054,07711,712,9693,588,00002,117,632stderr
9Jul 6, 2026 04:054,13711,466,6743,641,00002,117,632stderr