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 05:51M-RochatM-RochatScore: 72,855Success
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 05:5472,61273,418,07462,761,0001,138,0002,113,536
2May 17, 2026 05:5472,65972,670,95162,822,0001,118,0002,113,536
3May 17, 2026 05:5472,69272,948,30662,849,0001,120,0002,113,536
4May 17, 2026 05:5472,71874,081,65062,872,0001,120,0002,113,536
5May 17, 2026 05:5472,85572,840,26562,980,0001,133,0002,113,536
6May 17, 2026 05:5473,03872,996,47263,169,0001,105,0002,113,536
7May 17, 2026 05:5473,05372,941,45063,156,0001,131,0002,113,536
8May 17, 2026 05:5473,08173,235,17863,263,0001,049,0002,113,536
9May 17, 2026 05:5473,28075,178,66663,379,0001,108,0002,113,536