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 3, 2026 20:46TudyMTudyMScore: 30,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:5130,36839,932,55025,668,0001,056,0002,338,816
2May 3, 2026 20:5130,42046,340,49325,707,0001,063,0002,334,720
3May 3, 2026 20:5130,44042,909,28725,717,0001,071,0002,322,432
4May 3, 2026 20:5130,46243,744,85725,745,0001,062,0002,334,720
5May 3, 2026 20:5130,47643,461,38525,763,0001,056,0002,330,624
6May 3, 2026 20:5130,50143,127,28325,779,0001,062,0002,322,432
7May 3, 2026 20:5130,50743,966,17625,783,0001,064,0002,322,432
8May 3, 2026 20:5130,52145,971,64925,779,0001,080,0002,338,816
9May 3, 2026 20:5130,57242,642,82825,824,0001,080,0002,330,624