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 listMay 3, 2026 20:51TudyMTudyMScore: 30,939Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:5730,91140,876,91726,128,0001,074,0002,338,816
2May 3, 2026 20:5730,91241,490,19226,138,0001,065,0002,334,720
3May 3, 2026 20:5730,91743,139,49926,127,0001,080,0002,359,296
4May 3, 2026 20:5730,92643,637,74526,140,0001,075,0002,334,720
5May 3, 2026 20:5730,93943,529,70726,160,0001,067,0002,338,816
6May 3, 2026 20:5730,94543,750,22026,160,0001,072,0002,359,296
7May 3, 2026 20:5731,00444,127,37426,217,0001,067,0002,342,912
8May 3, 2026 20:5731,01744,569,24826,237,0001,058,0002,342,912
9May 3, 2026 20:5731,12343,658,10126,306,0001,083,0002,334,720