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 16, 2026 16:01M-RochatM-RochatScore: 77,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 16:0677,59876,831,39267,189,0001,098,0002,113,536
2May 16, 2026 16:0677,61976,867,04467,178,0001,127,0002,113,536
3May 16, 2026 16:0677,62176,910,46967,184,0001,123,0002,113,536
4May 16, 2026 16:0677,70479,392,15467,236,0001,144,0002,113,536
5May 16, 2026 16:0677,72277,788,14467,279,0001,117,0002,113,536
6May 16, 2026 16:0677,79779,530,89167,320,0001,142,0002,113,536
7May 16, 2026 16:0677,80077,127,09967,453,0001,011,0002,113,536
8May 16, 2026 16:0677,83077,044,01067,378,0001,113,0002,113,536
9May 16, 2026 16:0678,00977,303,77567,512,0001,136,0002,113,536