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 02:04M-RochatM-RochatScore: 26,255Success
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 02:0626,09433,289,83021,802,0001,161,0002,113,536
2May 17, 2026 02:0626,10931,554,08421,836,0001,140,0002,113,536
3May 17, 2026 02:0626,14633,440,03921,853,0001,156,0002,113,536
4May 17, 2026 02:0626,24733,549,70222,056,0001,042,0002,113,536
5May 17, 2026 02:0626,25533,677,91121,952,0001,153,0002,113,536
6May 17, 2026 02:0626,26531,647,30621,974,0001,140,0002,113,536
7May 17, 2026 02:0626,32033,475,90322,010,0001,152,0002,113,536
8May 17, 2026 02:0626,32834,723,27822,008,0001,161,0002,113,536
9May 17, 2026 02:0626,37032,172,17222,174,0001,032,0002,113,536