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 24, 2023 21:14mmalczakmmalczakScore: 73,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:1472,53554,944,77225,844,000994,0002,265,088
2Sep 24, 2023 21:1472,70349,965,07525,866,0001,034,0002,289,664
3Sep 24, 2023 21:1472,80550,645,55024,943,0001,995,0002,375,680
4Sep 24, 2023 21:1472,90048,950,01824,975,0001,998,0002,387,968
5Sep 24, 2023 21:1472,97651,211,51826,001,0001,000,0002,269,184
6Sep 24, 2023 21:1473,20851,168,19326,084,0001,003,0002,523,136
7Sep 24, 2023 21:1473,27646,565,36925,104,0002,008,0002,289,664
8Sep 24, 2023 21:1473,45750,125,54726,173,0001,006,0002,289,664
9Sep 24, 2023 21:1473,46552,030,94926,176,0001,006,0002,289,664
10Sep 24, 2023 21:1475,819105,470,85628,053,12902,260,992
11Sep 24, 2023 21:1476,035103,533,00028,132,90902,269,184
12Sep 24, 2023 21:1476,32888,617,42128,241,38202,269,184