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:31Josu San MartinJosu San MartinScore: 5,345Success
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 00:345,28212,413,3794,649,00002,113,536
2Jun 23, 2026 00:345,32812,144,4844,689,00002,113,536
3Jun 23, 2026 00:345,33512,162,5194,695,00002,113,536
4Jun 23, 2026 00:345,34411,964,2344,703,00002,113,536
5Jun 23, 2026 00:345,34512,337,0054,704,00002,113,536
6Jun 23, 2026 00:345,36312,151,0394,720,00002,113,536
7Jun 23, 2026 00:345,36512,532,2764,722,00002,113,536
8Jun 23, 2026 00:345,38012,568,4914,735,00002,113,536
9Jun 23, 2026 00:345,40712,387,2184,759,00002,113,536