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 22, 2026 16:55M-RochatM-RochatScore: 23,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 16:5723,40230,479,97219,518,0001,076,0002,113,536
2May 22, 2026 16:5723,41032,266,17819,535,0001,066,0002,113,536
3May 22, 2026 16:5723,41730,293,75219,545,0001,062,0002,113,536
4May 22, 2026 16:5723,45629,865,38719,613,0001,029,0002,113,536
5May 22, 2026 16:5723,47131,711,41919,496,0001,159,0002,113,536
6May 22, 2026 16:5723,54032,655,47119,650,0001,066,0002,113,536
7May 22, 2026 16:5723,55132,226,45319,579,0001,146,0002,113,536
8May 22, 2026 16:5723,61932,946,04119,755,0001,030,0002,113,536
9May 22, 2026 16:5723,62729,921,60319,645,0001,147,0002,113,536