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 listSep 10, 2026 15:44Andrew EpsteinAndrew EpsteinScore: 6,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 15:525,90915,159,0574,074,0001,126,0002,117,632
2Sep 10, 2026 15:525,91515,122,6244,081,0001,125,0002,117,632
3Sep 10, 2026 15:525,93215,169,8004,085,0001,136,0002,117,632
4Sep 10, 2026 15:526,00719,768,0344,075,0001,212,0002,117,632
5Sep 10, 2026 15:526,02615,114,9274,085,0001,218,0002,117,632
6Sep 10, 2026 15:526,02615,331,7954,095,0001,208,0002,117,632
7Sep 10, 2026 15:526,04415,501,9154,087,0001,232,0002,117,632
8Sep 10, 2026 15:526,05415,222,7624,095,0001,233,0002,117,632
9Sep 10, 2026 15:526,06515,090,1324,106,0001,232,0002,117,632