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 15:55M-RochatM-RochatScore: 43,881Success
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 15:5743,70149,837,69837,309,0001,148,0002,113,536
2May 16, 2026 15:5743,70547,016,01537,332,0001,129,0002,113,536
3May 16, 2026 15:5743,72547,147,69137,363,0001,115,0002,113,536
4May 16, 2026 15:5743,87048,283,90137,486,0001,120,0002,113,536
5May 16, 2026 15:5743,88147,772,85337,470,0001,146,0002,113,536
6May 16, 2026 15:5743,92849,282,37937,527,0001,130,0002,113,536
7May 16, 2026 15:5743,95747,343,52137,563,0001,120,0002,113,536
8May 16, 2026 15:5744,00048,472,94937,574,0001,146,0002,113,536
9May 16, 2026 15:5744,03447,293,01037,599,0001,151,0002,113,536