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 3, 2021 14:38Ilya AniskovetsIlya AniskovetsScore: 119,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2021 14:38118,55772,187,98642,870,000996,0002,523,136
2Sep 3, 2021 14:38118,57675,130,75541,879,0001,994,0002,289,664
3Sep 3, 2021 14:38118,60067,809,68441,888,0001,994,0002,371,584
4Sep 3, 2021 14:38119,00567,329,72743,032,0001,000,0002,289,664
5Sep 3, 2021 14:38119,02269,821,34642,037,0002,001,0002,289,664
6Sep 3, 2021 14:38119,14364,923,28542,080,0002,003,0002,367,488
7Sep 3, 2021 14:38119,19568,007,88842,098,0002,004,0002,289,664
8Sep 3, 2021 14:38119,25164,644,35543,121,0001,002,0002,289,664
9Sep 3, 2021 14:38119,41167,769,78142,174,0002,008,0002,289,664
10Sep 3, 2021 14:38121,811118,959,85445,070,24002,260,992
11Sep 3, 2021 14:38121,822115,103,03945,074,32002,256,896
12Sep 3, 2021 14:38123,153107,740,95845,566,67102,260,992