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 20:17piculpiculScore: 82,146Success
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 20:1781,37853,610,28829,107,0001,003,0002,527,232
2Sep 15, 2021 20:1781,42453,235,20528,119,0002,008,0002,289,664
3Sep 15, 2021 20:1781,49753,470,59828,144,0002,010,0002,531,328
4Sep 15, 2021 20:1781,50855,730,86128,148,0002,010,0002,269,184
5Sep 15, 2021 20:1781,53852,436,36528,158,0002,011,0002,289,664
6Sep 15, 2021 20:1781,54958,300,96128,162,0002,011,0002,289,664
7Sep 15, 2021 20:1782,14652,813,76629,381,0001,013,0002,289,664
8Sep 15, 2021 20:1782,17053,857,91529,390,0001,013,0002,289,664
9Sep 15, 2021 20:1782,30053,801,69428,421,0002,030,0002,289,664
10Sep 15, 2021 20:1787,358103,568,99632,322,39302,252,800
11Sep 15, 2021 20:1788,02893,302,40732,570,42302,269,184
12Sep 15, 2021 20:1788,069103,268,23832,585,58102,252,800