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 23, 2026 05:03Victor MerckléVictor MerckléScore: 6,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 05:065,98012,766,6675,263,00002,113,536
2Jun 23, 2026 05:065,99612,804,9045,277,00002,113,536
3Jun 23, 2026 05:065,99812,797,9185,279,00002,113,536
4Jun 23, 2026 05:066,04412,787,9985,319,00002,113,536
5Jun 23, 2026 05:066,09312,799,0985,362,00002,113,536
6Jun 23, 2026 05:066,09713,124,9095,366,00002,113,536
7Jun 23, 2026 05:066,10413,132,7205,372,00002,113,536
8Jun 23, 2026 05:066,15912,876,2165,420,00002,113,536
9Jun 23, 2026 05:066,17013,257,2745,430,00002,113,536