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 07:11Sergey StreminSergey StreminScore: 97,935Success
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 07:1196,88167,868,73133,855,0001,991,0002,494,464
2Sep 11, 2021 07:1196,94959,098,62033,879,0001,992,0002,306,048
3Sep 11, 2021 07:1197,30565,735,11034,003,0002,000,0002,486,272
4Sep 11, 2021 07:1197,43561,442,29435,050,0001,001,0002,285,568
5Sep 11, 2021 07:1197,58459,833,70434,101,0002,005,0002,314,240
6Sep 11, 2021 07:1197,60061,756,15034,106,0002,006,0002,306,048
7Sep 11, 2021 07:1197,93560,109,48234,223,0002,013,0002,486,272
8Sep 11, 2021 07:1198,47861,725,32235,425,0001,012,0002,490,368
9Sep 11, 2021 07:1198,55462,363,59435,453,0001,012,0002,490,368
10Sep 11, 2021 07:11134,718110,381,28549,845,52502,260,992
11Sep 11, 2021 07:11134,989110,818,06749,945,84502,265,088
12Sep 11, 2021 07:11135,218108,016,95850,030,75902,269,184