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 10:41Josu San MartinJosu San MartinScore: 6,826Success
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 10:456,72913,508,2865,922,00002,113,536
2Jun 22, 2026 10:456,74513,530,4275,936,00002,113,536
3Jun 22, 2026 10:456,79613,655,3285,981,00002,113,536
4Jun 22, 2026 10:456,80313,595,2455,987,00002,113,536
5Jun 22, 2026 10:456,82613,573,7496,007,00002,113,536
6Jun 22, 2026 10:456,88713,574,6476,061,00002,113,536
7Jun 22, 2026 10:456,92513,622,1376,094,00002,113,536
8Jun 22, 2026 10:456,96313,740,5966,128,00002,113,536
9Jun 22, 2026 10:456,98713,804,9606,149,00002,113,536