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 5, 2026 22:42Victor MerckléVictor MerckléScore: 4,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 22:474,29012,111,2993,776,00002,117,632stderr
2Jul 5, 2026 22:474,39211,586,1023,865,00002,117,632stderr
3Jul 5, 2026 22:474,40911,684,8573,880,00002,117,632stderr
4Jul 5, 2026 22:474,42511,941,9213,894,00002,117,632stderr
5Jul 5, 2026 22:474,43011,995,0063,899,00002,117,632stderr
6Jul 5, 2026 22:474,46911,652,2513,933,00002,117,632stderr
7Jul 5, 2026 22:474,49213,128,4163,953,00002,117,632stderr
8Jul 5, 2026 22:474,50612,433,4063,966,00002,117,632stderr
9Jul 5, 2026 22:474,51519,084,2733,974,00002,117,632stderr