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 08:588QTK8QTKScore: 124,142Success
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 08:58123,819136,315,253105,963,0002,998,0002,285,568
2Jan 23, 2025 08:58123,973132,178,778107,095,0002,001,0002,289,664
3Jan 23, 2025 08:58124,027136,819,205107,142,0002,002,0002,285,568
4Jan 23, 2025 08:58124,090130,979,309108,198,0001,001,0002,285,568
5Jan 23, 2025 08:58124,142135,599,486106,239,0003,006,0002,285,568
6Jan 23, 2025 08:58124,195136,165,133108,290,0001,002,0002,289,664
7Jan 23, 2025 08:58124,294135,708,908108,376,0001,003,0002,265,088
8Jan 23, 2025 08:58124,619140,226,734107,653,0002,012,0002,289,664
9Jan 23, 2025 08:58124,926136,678,481106,937,0002,998,0002,289,664