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 15, 2021 19:44piculpiculScore: 73,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 19:4472,67054,366,14824,897,0001,991,0002,273,280
2Sep 15, 2021 19:4472,67049,344,00124,897,0001,991,0002,289,664
3Sep 15, 2021 19:4472,81649,649,65824,947,0001,995,0002,273,280
4Sep 15, 2021 19:4472,86252,789,22124,962,0001,997,0002,289,664
5Sep 15, 2021 19:4472,97349,480,57325,000,0002,000,0002,371,584
6Sep 15, 2021 19:4473,02250,554,78726,018,0001,000,0002,277,376
7Sep 15, 2021 19:4473,21449,677,29125,083,0002,006,0002,273,280
8Sep 15, 2021 19:4473,22751,990,80726,091,0001,003,0002,289,664
9Sep 15, 2021 19:4473,36553,022,01225,135,0002,010,0002,289,664
10Sep 15, 2021 19:4475,58893,208,54127,967,69502,265,088
11Sep 15, 2021 19:4475,93798,676,77728,096,82502,265,088
12Sep 15, 2021 19:4476,319102,286,34328,238,09802,260,992