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 27, 2022 13:30Robert BurkeRobert BurkeScore: 51,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2022 13:3050,53598,865,24444,470,49602,228,224
2Dec 27, 2022 13:3050,70094,430,95044,616,23502,220,032
3Dec 27, 2022 13:3050,79696,048,28344,700,41102,224,128
4Dec 27, 2022 13:3050,81869,826,87244,720,00002,392,064
5Dec 27, 2022 13:3051,01370,649,07543,894,000997,0002,535,424
6Dec 27, 2022 13:3051,01972,162,33043,900,000997,0002,535,424
7Dec 27, 2022 13:3051,02068,109,34143,901,000997,0002,392,064
8Dec 27, 2022 13:3051,03071,717,84242,911,0001,995,0002,400,256
9Dec 27, 2022 13:3051,04075,737,61342,919,0001,996,0002,273,280
10Dec 27, 2022 13:3051,12664,725,82943,992,000999,0002,396,160
11Dec 27, 2022 13:3051,18870,250,59843,043,0002,002,0002,535,424
12Dec 27, 2022 13:3051,28066,137,96643,121,0002,005,0002,387,968