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 04:21Victor MerckléVictor MerckléScore: 6,096Success
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 04:245,99312,760,9695,274,00002,113,536
2Jun 23, 2026 04:246,00112,776,7955,281,00002,113,536
3Jun 23, 2026 04:246,01212,771,2705,291,00002,113,536
4Jun 23, 2026 04:246,05912,803,4585,332,00002,113,536
5Jun 23, 2026 04:246,09612,867,1735,365,00002,113,536
6Jun 23, 2026 04:246,10012,819,5085,368,00002,113,536
7Jun 23, 2026 04:246,10112,924,5825,369,00002,113,536
8Jun 23, 2026 04:246,11213,059,6195,379,00002,113,536
9Jun 23, 2026 04:246,14212,832,0275,405,00002,113,536