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 19:02Victor MerckléVictor MerckléScore: 4,006Success
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 19:053,88911,270,1423,423,00002,117,632stderr
2Jul 6, 2026 19:053,91311,259,5833,444,00002,117,632stderr
3Jul 6, 2026 19:053,98811,348,9473,510,00002,117,632stderr
4Jul 6, 2026 19:054,00412,894,5113,524,00002,117,632stderr
5Jul 6, 2026 19:054,00611,327,2833,526,00002,117,632stderr
6Jul 6, 2026 19:054,00911,706,7873,528,00002,117,632stderr
7Jul 6, 2026 19:054,01011,320,6983,529,00002,117,632stderr
8Jul 6, 2026 19:054,01812,269,3413,536,00002,117,632stderr
9Jul 6, 2026 19:054,05111,346,8823,565,00002,117,632stderr