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 20, 2026 19:32Josu San MartinJosu San MartinScore: 13,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:3513,30621,274,38110,690,0001,020,0002,113,536
2May 20, 2026 19:3513,38021,424,58510,766,0001,009,0002,117,632
3May 20, 2026 19:3513,40020,922,29110,763,0001,029,0002,113,536
4May 20, 2026 19:3513,41721,975,51610,800,0001,007,0002,113,536
5May 20, 2026 19:3513,53021,294,94510,870,0001,037,0002,113,536
6May 20, 2026 19:3513,74523,080,37511,072,0001,024,0002,113,536
7May 20, 2026 19:3513,82721,237,25111,083,0001,085,0002,113,536
8May 20, 2026 19:3514,16422,366,29511,439,0001,026,0002,117,632
9May 20, 2026 19:3514,70524,128,11511,910,0001,031,0002,113,536