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 23, 2026 02:51Victor MerckléVictor MerckléScore: 6,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 02:556,37213,133,3585,608,00002,113,536
2Jun 23, 2026 02:556,38513,138,3635,619,00002,113,536
3Jun 23, 2026 02:556,43913,157,6105,667,00002,113,536
4Jun 23, 2026 02:556,45313,417,5165,679,00002,113,536
5Jun 23, 2026 02:556,46213,433,1205,687,00002,113,536
6Jun 23, 2026 02:556,48113,557,8925,704,00002,113,536
7Jun 23, 2026 02:556,51213,287,8305,731,00002,113,536
8Jun 23, 2026 02:556,56513,537,8815,778,00002,113,536
9Jun 23, 2026 02:556,62813,629,7025,833,00002,113,536