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 02:47Victor MerckléVictor MerckléScore: 5,702Success
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 02:505,56212,837,8304,895,00002,117,632stderr
2Jul 6, 2026 02:505,57812,862,6914,909,00002,117,632stderr
3Jul 6, 2026 02:505,63912,845,3834,963,00002,117,632stderr
4Jul 6, 2026 02:505,70113,259,3645,017,00002,117,632stderr
5Jul 6, 2026 02:505,70213,061,6845,018,00002,117,632stderr
6Jul 6, 2026 02:505,70414,438,7635,020,00002,117,632stderr
7Jul 6, 2026 02:505,72313,041,7795,037,00002,117,632stderr
8Jul 6, 2026 02:505,75212,887,2675,062,00002,117,632stderr
9Jul 6, 2026 02:505,76512,995,0025,074,00002,117,632stderr