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:13Victor MerckléVictor MerckléScore: 6,065Success
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:165,95712,794,0695,243,00002,113,536
2Jun 23, 2026 05:165,96412,776,4785,249,00002,113,536
3Jun 23, 2026 05:165,96712,780,0465,251,00002,113,536
4Jun 23, 2026 05:165,97012,827,4055,254,00002,113,536
5Jun 23, 2026 05:166,06512,808,9035,338,00002,113,536
6Jun 23, 2026 05:166,07113,010,5585,343,00002,113,536
7Jun 23, 2026 05:166,14713,164,2905,410,00002,113,536
8Jun 23, 2026 05:166,15612,873,6815,418,00002,113,536
9Jun 23, 2026 05:166,50413,350,4835,724,00002,113,536