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 06:58Sergey StreminSergey StreminScore: 101,873Success
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 06:58100,44659,446,95236,161,0001,004,0002,371,584
2Sep 11, 2021 06:58100,52263,095,32135,183,0002,010,0002,379,776
3Sep 11, 2021 06:58100,74158,812,51135,260,0002,014,0002,289,664
4Sep 11, 2021 06:58100,78456,549,89936,283,0001,007,0002,367,488
5Sep 11, 2021 06:58101,30364,084,08336,469,0001,013,0002,371,584
6Sep 11, 2021 06:58101,57198,239,66637,581,32902,256,896
7Sep 11, 2021 06:58101,87369,670,47736,675,0001,018,0002,289,664
8Sep 11, 2021 06:58102,62464,127,00335,973,0001,998,0002,379,776
9Sep 11, 2021 06:58102,66262,822,92136,986,000999,0002,289,664
10Sep 11, 2021 06:58103,066108,104,31938,134,57202,199,552
11Sep 11, 2021 06:58103,293102,771,06538,218,42502,256,896
12Sep 11, 2021 06:58104,35167,649,07238,610,00002,289,664