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 07:37apuxbtapuxbtScore: 30,674Success
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 07:3730,55256,530,38924,895,0001,991,0002,387,968
2Dec 1, 2022 07:3730,57252,922,73325,907,000996,0002,265,088
3Dec 1, 2022 07:3730,57851,665,02825,913,000996,0002,265,088
4Dec 1, 2022 07:3730,62055,350,39824,950,0001,996,0002,375,680
5Dec 1, 2022 07:3730,64754,376,25624,972,0001,997,0002,379,776
6Dec 1, 2022 07:3730,65655,415,39425,978,000999,0002,265,088
7Dec 1, 2022 07:3730,67454,791,75125,994,000999,0002,379,776
8Dec 1, 2022 07:3730,68055,118,73925,999,000999,0002,265,088
9Dec 1, 2022 07:3730,69596,262,84127,011,73902,232,320
10Dec 1, 2022 07:3730,69895,335,84827,013,88102,228,224
11Dec 1, 2022 07:3730,70585,130,18627,020,04402,236,416
12Dec 1, 2022 07:3730,74953,199,12025,055,0002,004,0002,265,088