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 20, 2025 11:57matsuoka-601matsuoka-601Score: 8,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2025 11:578,83223,865,3317,772,00002,269,184
2Jan 20, 2025 11:578,99229,413,9925,935,0001,978,0002,473,984
3Jan 20, 2025 11:578,99523,553,2596,927,000989,0002,531,328
4Jan 20, 2025 11:578,99727,212,1664,948,0002,969,0002,428,928
5Jan 20, 2025 11:578,99824,553,4204,949,0002,969,0002,531,328
6Jan 20, 2025 11:579,00525,812,5116,934,000990,0002,269,184
7Jan 20, 2025 11:579,03625,019,8425,964,0001,988,0002,531,328
8Jan 20, 2025 11:579,03823,404,6175,965,0001,988,0002,531,328
9Jan 20, 2025 11:579,05726,202,9715,978,0001,992,0002,416,640