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:55apuxbtapuxbtScore: 32,500Success
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:5531,84899,432,59628,026,33202,240,512
2Dec 1, 2022 05:5531,87187,820,96728,046,26002,236,416
3Dec 1, 2022 05:5531,89096,641,81528,062,94202,244,608
4Dec 1, 2022 05:5532,36551,162,10227,464,0001,017,0002,265,088
5Dec 1, 2022 05:5532,45053,114,02027,537,0001,019,0002,265,088
6Dec 1, 2022 05:5532,49449,653,68427,574,0001,021,0002,383,872
7Dec 1, 2022 05:5532,50052,095,74128,600,00002,265,088
8Dec 1, 2022 05:5532,51152,465,46427,589,0001,021,0002,265,088
9Dec 1, 2022 05:5532,55549,865,40327,625,0001,023,0002,265,088
10Dec 1, 2022 05:5532,59255,852,79127,657,0001,024,0002,379,776
11Dec 1, 2022 05:5532,63656,575,62727,695,0001,025,0002,265,088
12Dec 1, 2022 05:5532,83054,550,50027,894,000996,0002,265,088