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:19M-RochatM-RochatScore: 36,751Success
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:3036,66941,266,08231,138,0001,131,0002,113,536
2May 16, 2026 20:3036,67541,223,94031,139,0001,135,0002,113,536
3May 16, 2026 20:3036,72544,118,33431,171,0001,147,0002,113,536
4May 16, 2026 20:3036,72640,913,73131,164,0001,155,0002,113,536
5May 16, 2026 20:3036,75140,917,49631,228,0001,113,0002,113,536
6May 16, 2026 20:3036,75340,987,27731,201,0001,142,0002,113,536
7May 16, 2026 20:3036,80240,976,79831,246,0001,140,0002,113,536
8May 16, 2026 20:3036,90041,051,54731,325,0001,147,0002,113,536
9May 16, 2026 20:3036,90241,016,45331,356,0001,118,0002,113,536