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 17:08M-RochatM-RochatScore: 23,392Success
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 17:1123,28630,418,07419,432,0001,060,0002,113,536
2May 22, 2026 17:1123,32929,913,03719,472,0001,058,0002,113,536
3May 22, 2026 17:1123,33529,975,92419,472,0001,063,0002,113,536
4May 22, 2026 17:1123,34529,867,79119,485,0001,059,0002,113,536
5May 22, 2026 17:1123,39230,319,03119,512,0001,073,0002,113,536
6May 22, 2026 17:1123,40232,069,71819,443,0001,151,0002,113,536
7May 22, 2026 17:1123,45331,610,12319,607,0001,032,0002,113,536
8May 22, 2026 17:1123,45632,168,00619,485,0001,157,0002,113,536
9May 22, 2026 17:1123,56429,974,13519,579,0001,158,0002,113,536