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 listJun 23, 2026 16:59anboto1anboto1Score: 46,088Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 17:0145,93949,390,37739,258,0001,169,0002,113,536
2Jun 23, 2026 17:0146,00449,480,64639,324,0001,160,0002,113,536
3Jun 23, 2026 17:0146,01349,437,44439,322,0001,170,0002,113,536
4Jun 23, 2026 17:0146,07649,435,19439,317,0001,230,0002,113,536
5Jun 23, 2026 17:0146,08849,505,13439,337,0001,221,0002,113,536
6Jun 23, 2026 17:0146,13549,524,36739,380,0001,219,0002,113,536
7Jun 23, 2026 17:0146,16949,607,80839,375,0001,254,0002,113,536
8Jun 23, 2026 17:0146,20351,081,85739,400,0001,259,0002,113,536
9Jun 23, 2026 17:0146,20949,590,80839,509,0001,155,0002,113,536