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:21Josu San MartinJosu San MartinScore: 5,282Success
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:265,24612,053,5564,617,00002,113,536
2Jun 23, 2026 02:265,25512,072,3634,625,00002,113,536
3Jun 23, 2026 02:265,25513,564,7824,625,00002,113,536
4Jun 23, 2026 02:265,26212,144,3804,631,00002,113,536
5Jun 23, 2026 02:265,28212,080,1944,649,00002,113,536
6Jun 23, 2026 02:265,36412,146,0994,721,00002,113,536
7Jun 23, 2026 02:265,38412,117,6914,738,00002,113,536
8Jun 23, 2026 02:265,38712,159,4684,741,00002,113,536
9Jun 23, 2026 02:265,39512,153,3644,748,00002,113,536