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:02TudyMTudyMScore: 30,379Success
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:0530,24443,315,23825,541,0001,074,0002,363,392
2May 3, 2026 20:0530,27243,685,34625,578,0001,062,0002,371,584
3May 3, 2026 20:0530,30040,760,06125,599,0001,065,0002,371,584
4May 3, 2026 20:0530,33744,709,25825,646,0001,051,0002,379,776
5May 3, 2026 20:0530,37941,167,47125,675,0001,059,0002,371,584
6May 3, 2026 20:0530,37945,463,14925,680,0001,054,0002,371,584
7May 3, 2026 20:0530,38040,635,22525,672,0001,063,0002,375,680
8May 3, 2026 20:0530,38142,838,64025,668,0001,068,0002,371,584
9May 3, 2026 20:0530,41443,864,32525,712,0001,053,0002,371,584