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:13Victor MerckléVictor MerckléScore: 3,978Success
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:153,87111,290,3753,407,00002,117,632stderr
2Jul 6, 2026 04:153,87511,203,6683,410,00002,117,632stderr
3Jul 6, 2026 04:153,88811,356,0943,422,00002,117,632stderr
4Jul 6, 2026 04:153,90411,272,1093,436,00002,117,632stderr
5Jul 6, 2026 04:153,97811,366,6503,501,00002,117,632stderr
6Jul 6, 2026 04:153,98411,315,9883,506,00002,117,632stderr
7Jul 6, 2026 04:153,98511,287,4643,507,00002,117,632stderr
8Jul 6, 2026 04:154,02711,130,0973,544,00002,117,632stderr
9Jul 6, 2026 04:154,05011,369,6653,564,00002,117,632stderr