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 17:34piculpiculScore: 108,030Success
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 17:34105,00066,567,38037,854,000996,0002,269,184
2Sep 15, 2021 17:34105,06269,254,87536,880,0001,993,0002,289,664
3Sep 15, 2021 17:34106,09762,157,14937,243,0002,013,0002,289,664
4Sep 15, 2021 17:34106,85761,227,69938,524,0001,013,0002,523,136
5Sep 15, 2021 17:34107,10868,821,42038,614,0001,016,0002,379,776
6Sep 15, 2021 17:34107,73073,770,05337,867,0001,993,0002,289,664
7Sep 15, 2021 17:34108,03063,502,14537,973,0001,998,0002,531,328
8Sep 15, 2021 17:34109,752126,545,01340,608,08502,248,704
9Sep 15, 2021 17:34110,72767,915,83838,971,0001,998,0002,265,088
10Sep 15, 2021 17:34111,79763,956,82139,348,0002,017,0002,289,664
11Sep 15, 2021 17:34113,024114,072,34041,818,82402,256,896
12Sep 15, 2021 17:34113,306109,983,23741,923,11902,244,608