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 19, 2026 20:09Victor MerckléVictor MerckléScore: 6,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 20:116,88013,549,2986,055,00002,113,536
2Jun 19, 2026 20:116,88513,556,0466,059,00002,113,536
3Jun 19, 2026 20:116,90013,551,8056,072,00002,113,536
4Jun 19, 2026 20:116,93513,567,6916,103,00002,113,536
5Jun 19, 2026 20:116,95113,416,1396,117,00002,113,536
6Jun 19, 2026 20:116,99713,758,9626,158,00002,113,536
7Jun 19, 2026 20:117,03013,670,8086,187,00002,113,536
8Jun 19, 2026 20:117,03413,610,1236,190,00002,113,536
9Jun 19, 2026 20:117,07913,703,0146,230,00002,113,536