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 listJun 6, 2026 08:23Victor MerckléVictor MerckléScore: 8,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 08:258,05314,435,3667,087,00002,113,536
2Jun 6, 2026 08:258,05414,559,4787,088,00002,113,536
3Jun 6, 2026 08:258,07014,520,4117,102,00002,113,536
4Jun 6, 2026 08:258,07014,538,9047,102,00002,113,536
5Jun 6, 2026 08:258,07314,508,0847,105,00002,113,536
6Jun 6, 2026 08:258,10515,933,3047,133,00002,113,536
7Jun 6, 2026 08:258,15114,582,7737,173,00002,113,536
8Jun 6, 2026 08:258,16514,504,8817,186,00002,113,536
9Jun 6, 2026 08:258,19614,590,6027,213,00002,113,536