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 22, 2026 18:57M-RochatM-RochatScore: 22,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 19:0022,69231,482,06518,913,0001,056,0002,113,536
2May 22, 2026 19:0022,70532,170,46018,933,0001,048,0002,113,536
3May 22, 2026 19:0022,75131,588,32418,973,0001,048,0002,113,536
4May 22, 2026 19:0022,75729,500,21918,886,0001,141,0002,113,536
5May 22, 2026 19:0022,76731,261,27218,994,0001,041,0002,113,536
6May 22, 2026 19:0022,81131,364,43619,023,0001,051,0002,113,536
7May 22, 2026 19:0022,81431,233,04218,945,0001,132,0002,113,536
8May 22, 2026 19:0022,87331,384,23119,039,0001,090,0002,113,536
9May 22, 2026 19:0022,87633,440,91519,004,0001,127,0002,113,536