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 listDec 1, 2022 05:32apuxbtapuxbtScore: 31,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2022 05:3231,69953,701,42625,903,0001,992,0002,265,088
2Dec 1, 2022 05:3231,70853,822,45025,910,0001,993,0002,265,088
3Dec 1, 2022 05:3231,71554,697,53825,916,0001,993,0002,383,872
4Dec 1, 2022 05:3231,75152,086,33326,944,000997,0002,265,088
5Dec 1, 2022 05:3231,80758,888,54326,991,000999,0002,379,776
6Dec 1, 2022 05:3231,84056,193,17127,019,0001,000,0002,265,088
7Dec 1, 2022 05:3231,85356,778,31127,030,0001,001,0002,265,088
8Dec 1, 2022 05:3231,86155,737,56726,036,0002,002,0002,387,968
9Dec 1, 2022 05:3231,87554,262,46627,049,0001,001,0002,265,088
10Dec 1, 2022 05:3232,442100,754,53428,549,14402,236,416
11Dec 1, 2022 05:3232,455104,103,39628,560,33702,232,320
12Dec 1, 2022 05:3232,49587,927,97628,595,40902,228,224