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 11, 2021 19:26Sergey StreminSergey StreminScore: 86,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 19:2686,06859,749,01030,850,000995,0002,281,472
2Sep 11, 2021 19:2686,08463,176,93729,861,0001,990,0002,281,472
3Sep 11, 2021 19:2686,09258,841,09830,859,000995,0002,277,376
4Sep 11, 2021 19:2686,37360,381,66730,960,000998,0002,281,472
5Sep 11, 2021 19:2686,59760,866,40430,039,0002,002,0002,539,520
6Sep 11, 2021 19:2686,77655,092,50531,104,0001,003,0002,498,560
7Sep 11, 2021 19:2686,95454,690,76531,168,0001,005,0002,277,376
8Sep 11, 2021 19:2687,58154,790,09932,405,00002,338,816
9Sep 11, 2021 19:2687,90559,710,02231,509,0001,016,0002,498,560
10Sep 11, 2021 19:2688,844110,766,96032,872,19902,203,648
11Sep 11, 2021 19:2689,21598,094,98333,009,37802,256,896
12Sep 11, 2021 19:2690,473107,658,60933,474,83902,211,840