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 06:59M-RochatM-RochatScore: 125,046Success
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 07:02124,707118,197,363109,743,00002,113,536
2May 16, 2026 07:02124,944120,399,907109,951,00002,113,536
3May 16, 2026 07:02124,992118,655,146109,993,00002,113,536
4May 16, 2026 07:02125,002121,655,806110,002,00002,113,536
5May 16, 2026 07:02125,046118,777,058110,041,00002,113,536
6May 16, 2026 07:02125,219118,828,964110,193,00002,113,536
7May 16, 2026 07:02125,220118,942,006110,194,00002,113,536
8May 16, 2026 07:02125,234118,808,923110,206,00002,113,536
9May 16, 2026 07:02125,492118,983,898109,403,0001,030,0002,113,536