TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listSep 11, 2021 18:47Sergey StreminSergey StreminScore: 71,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 18:4771,15456,065,59824,302,0002,025,0002,281,472
2Sep 11, 2021 18:4771,15447,108,28424,302,0002,025,0002,281,472
3Sep 11, 2021 18:4771,33050,717,18125,377,0001,015,0002,490,368
4Sep 11, 2021 18:4771,33548,357,64126,394,00002,494,464
5Sep 11, 2021 18:4771,41948,977,40826,425,00002,285,568
6Sep 11, 2021 18:4771,56547,735,86526,479,00002,277,376
7Sep 11, 2021 18:4771,65150,760,38626,511,00002,494,464
8Sep 11, 2021 18:4771,80348,886,81125,546,0001,021,0002,494,464
9Sep 11, 2021 18:4771,85454,811,83425,564,0001,022,0002,498,560
10Sep 11, 2021 18:4773,90794,140,41627,345,70502,260,992
11Sep 11, 2021 18:4774,48297,510,51327,558,23202,199,552
12Sep 11, 2021 18:4774,93095,303,88127,724,11902,207,744