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 5, 2026 12:06Victor MerckléVictor MerckléScore: 9,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 12:089,49315,806,0948,354,00002,113,536
2Jun 5, 2026 12:089,50915,799,5048,368,00002,113,536
3Jun 5, 2026 12:089,51215,836,8008,371,00002,113,536
4Jun 5, 2026 12:089,61915,891,0808,465,00002,113,536
5Jun 5, 2026 12:089,62515,917,4048,470,00002,113,536
6Jun 5, 2026 12:089,62716,179,3788,472,00002,113,536
7Jun 5, 2026 12:089,62915,896,3148,474,00002,113,536
8Jun 5, 2026 12:089,65615,954,2548,498,00002,113,536
9Jun 5, 2026 12:089,65715,957,3528,499,00002,113,536