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 04:01Josu San MartinJosu San MartinScore: 5,129Success
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 04:045,00411,949,9804,404,00002,113,536
2Jun 23, 2026 04:045,04511,909,7354,440,00002,113,536
3Jun 23, 2026 04:045,05211,940,7824,446,00002,113,536
4Jun 23, 2026 04:045,07911,994,5074,470,00002,113,536
5Jun 23, 2026 04:045,12911,939,7744,514,00002,113,536
6Jun 23, 2026 04:045,13511,768,7514,519,00002,113,536
7Jun 23, 2026 04:045,16012,356,0394,541,00002,113,536
8Jun 23, 2026 04:045,16011,823,5954,541,00002,113,536
9Jun 23, 2026 04:045,17012,512,4684,550,00002,113,536