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 18:27Victor MerckléVictor MerckléScore: 3,961Success
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 18:303,85911,215,6253,396,00002,117,632stderr
2Jul 6, 2026 18:303,86911,266,7433,405,00002,117,632stderr
3Jul 6, 2026 18:303,88611,256,1373,420,00002,117,632stderr
4Jul 6, 2026 18:303,90211,285,0883,434,00002,117,632stderr
5Jul 6, 2026 18:303,96111,398,1483,486,00002,117,632stderr
6Jul 6, 2026 18:303,97011,272,2473,494,00002,117,632stderr
7Jul 6, 2026 18:303,97611,299,3583,499,00002,117,632stderr
8Jul 6, 2026 18:303,98111,653,4633,504,00002,117,632stderr
9Jul 6, 2026 18:304,16211,541,8573,663,00002,117,632stderr