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:59M-RochatM-RochatScore: 23,464Success
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 17:0223,33831,666,77619,476,0001,062,0002,113,536
2May 22, 2026 17:0223,36231,715,52819,508,0001,051,0002,113,536
3May 22, 2026 17:0223,43132,163,10119,554,0001,066,0002,113,536
4May 22, 2026 17:0223,45130,299,64919,570,0001,067,0002,113,536
5May 22, 2026 17:0223,46432,471,03919,583,0001,066,0002,113,536
6May 22, 2026 17:0223,50130,995,74719,650,0001,031,0002,113,536
7May 22, 2026 17:0223,54330,157,94919,570,0001,148,0002,113,536
8May 22, 2026 17:0223,59832,861,21619,625,0001,142,0002,113,536
9May 22, 2026 17:0223,72131,075,91219,843,0001,032,0002,113,536