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:31TudyMTudyMScore: 30,067Success
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:3430,04543,123,67025,369,0001,071,0002,338,816
2May 3, 2026 20:3430,05344,676,72725,379,0001,068,0002,338,816
3May 3, 2026 20:3430,06044,728,57625,383,0001,070,0002,347,008
4May 3, 2026 20:3430,06142,816,31825,375,0001,079,0002,330,624
5May 3, 2026 20:3430,06745,825,95725,376,0001,083,0002,351,104
6May 3, 2026 20:3430,08242,707,68925,399,0001,074,0002,342,912
7May 3, 2026 20:3430,08643,084,89725,413,0001,063,0002,338,816
8May 3, 2026 20:3430,20144,175,00825,518,0001,059,0002,342,912
9May 3, 2026 20:3430,20942,899,46225,526,0001,058,0002,334,720