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 12:30M-RochatM-RochatScore: 50,609Success
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 12:3350,32953,474,56743,152,0001,138,0002,113,536
2May 17, 2026 12:3350,50056,227,80643,338,0001,102,0002,113,536
3May 17, 2026 12:3350,54353,576,60143,370,0001,108,0002,113,536
4May 17, 2026 12:3350,59553,949,91843,422,0001,102,0002,113,536
5May 17, 2026 12:3350,60953,938,03743,433,0001,103,0002,113,536
6May 17, 2026 12:3350,62155,050,31243,418,0001,129,0002,113,536
7May 17, 2026 12:3350,64755,167,80443,454,0001,116,0002,113,536
8May 17, 2026 12:3350,77254,898,96543,633,0001,047,0002,113,536
9May 17, 2026 12:3350,81854,270,18943,601,0001,119,0002,113,536