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 21, 2026 14:41Victor MerckléVictor MerckléScore: 6,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 14:446,66113,319,6545,862,00002,113,536
2Jun 21, 2026 14:446,70713,498,1255,903,00002,113,536
3Jun 21, 2026 14:446,75013,391,6225,940,00002,113,536
4Jun 21, 2026 14:446,75113,374,6715,941,00002,113,536
5Jun 21, 2026 14:446,75313,689,1955,943,00002,113,536
6Jun 21, 2026 14:446,77313,461,3265,961,00002,113,536
7Jun 21, 2026 14:446,81913,781,5826,001,00002,113,536
8Jun 21, 2026 14:446,89513,504,3886,068,00002,113,536
9Jun 21, 2026 14:446,92713,910,7906,096,00002,113,536