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: 44,796Success
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:1743,51749,132,32237,187,0001,108,0002,113,536
2May 17, 2026 01:1744,12249,276,49037,713,0001,115,0002,113,536
3May 17, 2026 01:1744,16847,442,80737,757,0001,111,0002,113,536
4May 17, 2026 01:1744,54350,707,32638,074,0001,124,0002,113,536
5May 17, 2026 01:1744,79648,489,03838,305,0001,116,0002,113,536
6May 17, 2026 01:1745,35151,444,76538,794,0001,115,0002,113,536
7May 17, 2026 01:1745,50150,918,09138,931,0001,110,0002,113,536
8May 17, 2026 01:1745,55051,558,04938,953,0001,131,0002,113,536
9May 17, 2026 01:1745,55351,252,72438,960,0001,127,0002,113,536