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 00:57Josu San MartinJosu San MartinScore: 5,425Success
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 01:005,30112,065,6824,665,00002,113,536
2Jun 23, 2026 01:005,31812,227,6104,680,00002,113,536
3Jun 23, 2026 01:005,39212,195,4974,745,00002,113,536
4Jun 23, 2026 01:005,39712,585,5604,750,00002,113,536
5Jun 23, 2026 01:005,42512,070,3784,774,00002,113,536
6Jun 23, 2026 01:005,44212,109,5104,789,00002,113,536
7Jun 23, 2026 01:005,54512,346,5514,880,00002,113,536
8Jun 23, 2026 01:005,77312,562,0225,081,00002,113,536
9Jun 23, 2026 01:005,89612,436,3755,189,00002,113,536