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 06:30apuxbtapuxbtScore: 33,749Success
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 06:3032,684117,089,91028,762,34802,240,512
2Dec 1, 2022 06:3032,737125,695,68428,808,40202,240,512
3Dec 1, 2022 06:3032,78290,574,47528,848,24602,236,416
4Dec 1, 2022 06:3033,63556,687,20229,599,00002,387,968
5Dec 1, 2022 06:3033,64751,657,55029,609,00002,265,088
6Dec 1, 2022 06:3033,72658,841,60928,656,0001,023,0002,265,088
7Dec 1, 2022 06:3033,74954,382,35328,675,0001,024,0002,265,088
8Dec 1, 2022 06:3033,75360,702,53829,703,00002,265,088
9Dec 1, 2022 06:3033,77558,547,28829,722,00002,265,088
10Dec 1, 2022 06:3033,82456,513,91228,739,0001,026,0002,469,888
11Dec 1, 2022 06:3033,86156,377,74429,798,00002,383,872
12Dec 1, 2022 06:3033,95958,949,27229,884,00002,265,088