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:42Ilya AniskovetsIlya AniskovetsScore: 114,168Success
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:42113,80563,971,11040,103,0002,005,0002,289,664
2Sep 3, 2021 14:42113,92469,469,08741,149,0001,003,0002,289,664
3Sep 3, 2021 14:42113,98467,125,91140,166,0002,008,0002,289,664
4Sep 3, 2021 14:42114,08166,932,13341,205,0001,005,0002,289,664
5Sep 3, 2021 14:42114,08664,491,69741,207,0001,005,0002,289,664
6Sep 3, 2021 14:42114,08968,347,88840,203,0002,010,0002,523,136
7Sep 3, 2021 14:42114,16867,686,26840,231,0002,011,0002,289,664
8Sep 3, 2021 14:42114,17066,369,40540,232,0002,011,0002,289,664
9Sep 3, 2021 14:42114,18666,950,00840,238,0002,011,0002,519,040
10Sep 3, 2021 14:42127,888115,199,03247,318,49502,260,992
11Sep 3, 2021 14:42128,274120,559,30147,461,38102,265,088
12Sep 3, 2021 14:42128,382112,812,81047,501,38802,260,992