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 19:24piculpiculScore: 72,905Success
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 19:2472,19753,654,74225,686,0001,027,0002,289,664
2Sep 15, 2021 19:2472,54354,785,17525,847,000994,0002,273,280
3Sep 15, 2021 19:2472,55754,292,59824,858,0001,988,0002,277,376
4Sep 15, 2021 19:2472,78955,994,52624,937,0001,995,0002,289,664
5Sep 15, 2021 19:2472,80048,659,29725,939,000997,0002,523,136
6Sep 15, 2021 19:2472,89249,751,91425,972,000998,0002,273,280
7Sep 15, 2021 19:2472,90557,401,85725,976,000999,0002,281,472
8Sep 15, 2021 19:2472,98150,444,99925,003,0002,000,0002,289,664
9Sep 15, 2021 19:2473,03552,157,35825,022,0002,001,0002,531,328
10Sep 15, 2021 19:2475,90390,980,47728,084,25502,273,280
11Sep 15, 2021 19:2475,976112,802,27628,110,95202,252,800
12Sep 15, 2021 19:2476,21795,642,23528,200,22602,269,184