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 listSep 1, 2026 04:33Victor MerckléVictor MerckléScore: 3,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 04:363,12210,767,5762,748,00002,117,632stderr
2Sep 1, 2026 04:363,12910,626,8752,754,00002,117,632stderr
3Sep 1, 2026 04:363,12910,577,8292,754,00002,117,632stderr
4Sep 1, 2026 04:363,13210,632,1842,757,00002,117,632stderr
5Sep 1, 2026 04:363,13410,594,2382,758,00002,117,632stderr
6Sep 1, 2026 04:363,14210,638,0372,765,00002,117,632stderr
7Sep 1, 2026 04:363,23210,610,4882,845,00002,117,632stderr
8Sep 1, 2026 04:363,25210,606,8892,862,00002,117,632stderr
9Sep 1, 2026 04:363,26210,652,8532,871,00002,117,632stderr