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:54Josu San MartinJosu San MartinScore: 5,171Success
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:595,06811,954,8364,460,00002,113,536
2Jun 23, 2026 04:595,07112,005,1744,463,00002,113,536
3Jun 23, 2026 04:595,15711,968,5814,539,00002,113,536
4Jun 23, 2026 04:595,16312,057,5934,544,00002,113,536
5Jun 23, 2026 04:595,17112,008,3264,551,00002,113,536
6Jun 23, 2026 04:595,17211,987,0904,552,00002,113,536
7Jun 23, 2026 04:595,19012,007,6334,568,00002,113,536
8Jun 23, 2026 04:595,19612,012,6444,573,00002,113,536
9Jun 23, 2026 04:595,64812,558,1054,971,00002,113,536