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 22, 2026 12:33Josu San MartinJosu San MartinScore: 6,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 12:366,81813,892,9146,000,00002,113,536
2Jun 22, 2026 12:366,82713,920,6106,008,00002,113,536
3Jun 22, 2026 12:366,83513,326,7356,015,00002,113,536
4Jun 22, 2026 12:366,85913,946,1456,036,00002,113,536
5Jun 22, 2026 12:366,87313,920,5565,047,0001,002,0002,113,536
6Jun 22, 2026 12:366,97113,478,2966,135,00002,113,536
7Jun 22, 2026 12:367,04815,147,6546,203,00002,113,536
8Jun 22, 2026 12:367,10913,582,0115,249,0001,007,0002,113,536
9Jun 22, 2026 12:367,13213,768,9106,277,00002,113,536