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 20:00M-RochatM-RochatScore: 25,529Success
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 20:0325,39534,273,72421,282,0001,066,0002,113,536
2May 21, 2026 20:0325,40632,613,14621,278,0001,080,0002,113,536
3May 21, 2026 20:0325,42132,951,66921,301,0001,070,0002,113,536
4May 21, 2026 20:0325,43633,765,68221,309,0001,075,0002,113,536
5May 21, 2026 20:0325,52932,490,51521,292,0001,174,0002,113,536
6May 21, 2026 20:0325,57032,507,06121,454,0001,048,0002,113,536
7May 21, 2026 20:0325,59433,361,21121,477,0001,046,0002,113,536
8May 21, 2026 20:0325,64733,032,93221,530,0001,040,0002,113,536
9May 21, 2026 20:0325,65332,320,73321,413,0001,162,0002,113,536