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 20:40M-RochatM-RochatScore: 40,746Success
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 20:4340,55646,479,01234,622,0001,068,0002,113,536
2May 16, 2026 20:4340,69746,226,71434,754,0001,060,0002,113,536
3May 16, 2026 20:4340,71944,423,37534,770,0001,063,0002,113,536
4May 16, 2026 20:4340,72544,457,18534,762,0001,076,0002,113,536
5May 16, 2026 20:4340,74644,472,09134,806,0001,051,0002,113,536
6May 16, 2026 20:4340,79547,329,22634,813,0001,087,0002,113,536
7May 16, 2026 20:4341,01944,695,87035,010,0001,087,0002,113,536
8May 16, 2026 20:4341,05944,799,11135,080,0001,052,0002,113,536
9May 16, 2026 20:4341,06044,774,79635,055,0001,078,0002,113,536