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 21, 2023 19:05mmalczakmmalczakScore: 84,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 19:0583,21954,059,19528,739,0002,052,0002,289,664
2Sep 21, 2023 19:0583,33857,480,57629,841,000994,0002,289,664
3Sep 21, 2023 19:0583,44960,306,23628,884,0001,992,0002,289,664
4Sep 21, 2023 19:0583,65753,046,14429,955,000998,0002,289,664
5Sep 21, 2023 19:0583,73552,739,78728,984,0001,998,0002,387,968
6Sep 21, 2023 19:0583,78453,963,41129,000,0002,000,0002,289,664
7Sep 21, 2023 19:0584,17857,714,32429,137,0002,009,0002,527,232
8Sep 21, 2023 19:0584,24352,905,97029,159,0002,011,0002,289,664
9Sep 21, 2023 19:0584,64954,881,01829,300,0002,020,0002,531,328
10Sep 21, 2023 19:0585,888105,241,72931,778,47602,265,088
11Sep 21, 2023 19:0586,476106,134,29531,996,00902,260,992
12Sep 21, 2023 19:0586,856101,878,76332,136,71302,252,800