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 17, 2026 02:04M-RochatM-RochatScore: 26,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:0825,94833,185,21021,705,0001,130,0002,113,536
2May 17, 2026 02:0826,01234,269,06021,755,0001,136,0002,113,536
3May 17, 2026 02:0826,03533,164,33621,780,0001,131,0002,113,536
4May 17, 2026 02:0826,08133,551,39521,828,0001,124,0002,113,536
5May 17, 2026 02:0826,16133,308,39821,871,0001,151,0002,113,536
6May 17, 2026 02:0826,20031,704,96421,911,0001,145,0002,113,536
7May 17, 2026 02:0826,20131,693,21521,922,0001,135,0002,113,536
8May 17, 2026 02:0826,24833,847,01022,054,0001,045,0002,113,536
9May 17, 2026 02:0826,26832,022,50622,067,0001,049,0002,113,536