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 18:05Victor MerckléVictor MerckléScore: 5,215Success
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 18:075,09612,003,6074,485,00002,113,536
2Jun 23, 2026 18:075,10612,028,9774,494,00002,113,536
3Jun 23, 2026 18:075,20612,054,6604,582,00002,113,536
4Jun 23, 2026 18:075,21112,394,0194,586,00002,113,536
5Jun 23, 2026 18:075,21512,082,7214,590,00002,113,536
6Jun 23, 2026 18:075,22312,776,9804,597,00002,113,536
7Jun 23, 2026 18:075,22312,414,5944,597,00002,113,536
8Jun 23, 2026 18:075,22912,117,6584,602,00002,113,536
9Jun 23, 2026 18:075,25613,231,6494,626,00002,113,536