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 22, 2026 17:19M-RochatM-RochatScore: 23,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 17:2223,36032,777,51019,489,0001,068,0002,113,536
2May 22, 2026 17:2223,41931,733,25819,537,0001,072,0002,113,536
3May 22, 2026 17:2223,42730,119,44119,554,0001,062,0002,113,536
4May 22, 2026 17:2223,44532,040,93019,571,0001,061,0002,113,536
5May 22, 2026 17:2223,46430,503,79019,500,0001,149,0002,113,536
6May 22, 2026 17:2223,47530,906,84319,607,0001,051,0002,113,536
7May 22, 2026 17:2223,54332,170,53319,654,0001,064,0002,113,536
8May 22, 2026 17:2223,55232,261,61619,568,0001,158,0002,113,536
9May 22, 2026 17:2224,05630,607,98220,103,0001,067,0002,113,536