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 01:12M-RochatM-RochatScore: 35,025Success
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 01:1434,57939,726,18029,287,0001,143,0002,113,536
2May 17, 2026 01:1434,93039,944,58829,592,0001,147,0002,113,536
3May 17, 2026 01:1434,96739,338,67729,641,0001,130,0002,113,536
4May 17, 2026 01:1435,02141,146,16529,676,0001,143,0002,113,536
5May 17, 2026 01:1435,02541,296,11629,684,0001,138,0002,113,536
6May 17, 2026 01:1435,05441,163,37429,721,0001,127,0002,113,536
7May 17, 2026 01:1435,07139,699,37329,723,0001,140,0002,113,536
8May 17, 2026 01:1435,08541,182,02929,734,0001,141,0002,113,536
9May 17, 2026 01:1435,09339,772,52729,751,0001,131,0002,113,536