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 03:34Josu San MartinJosu San MartinScore: 5,182Success
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 03:365,05611,988,2494,450,00002,113,536
2Jun 23, 2026 03:365,16711,998,5954,547,00002,113,536
3Jun 23, 2026 03:365,18012,019,2584,559,00002,113,536
4Jun 23, 2026 03:365,18211,975,1984,561,00002,113,536
5Jun 23, 2026 03:365,18212,397,8694,561,00002,113,536
6Jun 23, 2026 03:365,49212,333,8994,833,00002,113,536
7Jun 23, 2026 03:365,53112,393,0254,868,00002,113,536
8Jun 23, 2026 03:365,67112,507,9014,991,00002,113,536
9Jun 23, 2026 03:365,76212,859,3895,071,00002,113,536