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 29, 2026 15:35Victor MerckléVictor MerckléScore: 4,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 15:384,57711,736,1794,028,00002,113,536
2Jun 29, 2026 15:384,60511,773,4884,053,00002,113,536
3Jun 29, 2026 15:384,60711,745,1114,055,00002,113,536
4Jun 29, 2026 15:384,61511,819,5304,062,00002,113,536
5Jun 29, 2026 15:384,70411,855,2794,140,00002,113,536
6Jun 29, 2026 15:384,71511,809,3814,150,00002,113,536
7Jun 29, 2026 15:384,71811,802,3134,152,00002,113,536
8Jun 29, 2026 15:384,71912,099,3624,153,00002,113,536
9Jun 29, 2026 15:384,73611,813,4694,168,00002,113,536