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 04:40Josu San MartinJosu San MartinScore: 5,873Success
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 04:435,77612,591,9425,083,00002,113,536
2Jun 23, 2026 04:435,86712,899,7445,163,00002,113,536
3Jun 23, 2026 04:435,86712,642,7525,163,00002,113,536
4Jun 23, 2026 04:435,86812,802,4555,164,00002,113,536
5Jun 23, 2026 04:435,87312,737,5805,169,00002,113,536
6Jun 23, 2026 04:435,88212,939,9595,177,00002,113,536
7Jun 23, 2026 04:435,88212,901,4745,177,00002,113,536
8Jun 23, 2026 04:435,88712,585,7655,181,00002,113,536
9Jun 23, 2026 04:435,89412,891,0285,187,00002,113,536