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 21, 2026 19:21M-RochatM-RochatScore: 23,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 19:2423,56731,514,45619,671,0001,068,0002,113,536
2May 21, 2026 19:2423,58430,747,55119,684,0001,070,0002,113,536
3May 21, 2026 19:2423,63031,812,11219,723,0001,072,0002,113,536
4May 21, 2026 19:2423,63532,712,87719,761,0001,038,0002,113,536
5May 21, 2026 19:2423,66730,011,07019,685,0001,142,0002,113,536
6May 21, 2026 19:2423,66830,118,56119,697,0001,131,0002,113,536
7May 21, 2026 19:2423,78133,608,07319,903,0001,025,0002,113,536
8May 21, 2026 19:2423,83431,707,96519,947,0001,027,0002,113,536
9May 21, 2026 19:2423,88430,466,73019,795,0001,223,0002,113,536