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 12:43Josu San MartinJosu San MartinScore: 6,959Success
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 12:466,79513,777,8785,980,00002,113,536
2Jun 22, 2026 12:466,89213,900,5416,065,00002,113,536
3Jun 22, 2026 12:466,90013,890,6905,070,0001,002,0002,113,536
4Jun 22, 2026 12:466,92613,919,1566,095,00002,113,536
5Jun 22, 2026 12:466,95913,685,3576,124,00002,113,536
6Jun 22, 2026 12:466,98013,639,7656,143,00002,113,536
7Jun 22, 2026 12:467,02513,626,9416,182,00002,113,536
8Jun 22, 2026 12:467,10413,739,3066,252,00002,113,536
9Jun 22, 2026 12:467,15114,103,3776,293,00002,113,536