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 21, 2026 19:46M-RochatM-RochatScore: 23,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 19:4923,54231,093,87819,641,0001,076,0002,113,536
2May 21, 2026 19:4923,55232,346,79919,661,0001,065,0002,113,536
3May 21, 2026 19:4923,57630,958,27619,691,0001,056,0002,113,536
4May 21, 2026 19:4923,62030,049,66319,761,0001,025,0002,113,536
5May 21, 2026 19:4923,62131,899,13619,622,0001,165,0002,113,536
6May 21, 2026 19:4923,62530,344,36019,710,0001,080,0002,113,536
7May 21, 2026 19:4923,65530,626,42419,792,0001,025,0002,113,536
8May 21, 2026 19:4923,74232,540,72419,866,0001,027,0002,113,536
9May 21, 2026 19:4923,75630,937,76819,858,0001,048,0002,113,536