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 6, 2026 08:00Victor MerckléVictor MerckléScore: 8,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 08:028,67515,080,0957,634,00002,113,536
2Jun 6, 2026 08:028,67715,081,3147,636,00002,113,536
3Jun 6, 2026 08:028,68615,132,6147,644,00002,113,536
4Jun 6, 2026 08:028,69215,124,0767,649,00002,113,536
5Jun 6, 2026 08:028,74715,163,5317,698,00002,113,536
6Jun 6, 2026 08:028,75115,096,8747,701,00002,113,536
7Jun 6, 2026 08:028,77115,097,9847,719,00002,113,536
8Jun 6, 2026 08:028,80215,501,2787,746,00002,113,536
9Jun 6, 2026 08:028,81815,460,4237,760,00002,113,536