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 18, 2026 09:26M-RochatM-RochatScore: 26,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 09:2926,60535,707,41922,282,0001,131,0002,113,536
2May 18, 2026 09:2926,64035,900,79322,317,0001,127,0002,113,536
3May 18, 2026 09:2926,68634,968,86122,350,0001,134,0002,113,536
4May 18, 2026 09:2926,72134,654,10322,376,0001,139,0002,113,536
5May 18, 2026 09:2926,86435,703,69422,482,0001,159,0002,113,536
6May 18, 2026 09:2926,88734,849,01122,518,0001,143,0002,113,536
7May 18, 2026 09:2926,90435,594,94022,521,0001,155,0002,113,536
8May 18, 2026 09:2926,97835,016,63222,595,0001,146,0002,113,536
9May 18, 2026 09:2927,03435,761,72722,604,0001,186,0002,113,536