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 listJan 23, 2025 09:248QTK8QTKScore: 103,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 09:24102,799118,853,15788,453,0002,010,0002,457,600
2Jan 23, 2025 09:24102,857113,313,11787,497,0003,017,0002,289,664
3Jan 23, 2025 09:24102,989126,637,76687,609,0003,021,0002,420,736
4Jan 23, 2025 09:24102,990117,097,48687,610,0003,021,0002,285,568
5Jan 23, 2025 09:24103,003116,440,69287,622,0003,021,0002,465,792
6Jan 23, 2025 09:24103,247118,183,87687,862,0002,995,0002,285,568
7Jan 23, 2025 09:24103,247117,753,10287,862,0002,995,0002,461,696
8Jan 23, 2025 09:24103,259117,332,96587,873,0002,995,0002,482,176
9Jan 23, 2025 09:24103,313115,270,51186,919,0003,996,0002,281,472