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:06Victor MerckléVictor MerckléScore: 6,769Success
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:096,73513,416,2955,927,00002,113,536
2Jun 21, 2026 14:096,75413,417,1115,944,00002,113,536
3Jun 21, 2026 14:096,76313,425,6415,952,00002,113,536
4Jun 21, 2026 14:096,76513,469,5485,954,00002,113,536
5Jun 21, 2026 14:096,76913,483,6105,957,00002,113,536
6Jun 21, 2026 14:096,85313,763,0386,031,00002,113,536
7Jun 21, 2026 14:096,96013,643,2806,125,00002,113,536
8Jun 21, 2026 14:097,10313,867,1156,251,00002,113,536
9Jun 21, 2026 14:097,16413,789,5376,305,00002,113,536