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:11Josu San MartinJosu San MartinScore: 5,170Success
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:145,04611,950,0344,441,00002,113,536
2Jun 23, 2026 04:145,05211,897,2574,446,00002,113,536
3Jun 23, 2026 04:145,16711,821,0974,547,00002,113,536
4Jun 23, 2026 04:145,16911,997,2224,549,00002,113,536
5Jun 23, 2026 04:145,17012,382,3324,550,00002,113,536
6Jun 23, 2026 04:145,19212,032,1304,569,00002,113,536
7Jun 23, 2026 04:145,19611,997,4554,573,00002,113,536
8Jun 23, 2026 04:145,19712,127,8484,574,00002,113,536
9Jun 23, 2026 04:145,23512,141,8624,607,00002,113,536