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: 82,411Success
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:3479,60359,886,57328,438,0001,015,0002,289,664
2Sep 15, 2021 17:3480,65755,577,62527,854,0001,989,0002,289,664
3Sep 15, 2021 17:3480,68956,157,94527,865,0001,990,0002,289,664
4Sep 15, 2021 17:3480,72254,373,77727,876,0001,991,0002,510,848
5Sep 15, 2021 17:3481,983105,975,02330,333,61402,256,896
6Sep 15, 2021 17:3482,13857,220,89228,365,0002,026,0002,289,664
7Sep 15, 2021 17:3482,41154,636,50129,476,0001,016,0002,289,664
8Sep 15, 2021 17:3483,24157,131,58229,806,000993,0002,289,664
9Sep 15, 2021 17:3483,31655,844,67828,839,0001,988,0002,289,664
10Sep 15, 2021 17:3483,33260,582,69428,844,0001,989,0002,289,664
11Sep 15, 2021 17:3484,15890,469,39331,138,41102,252,800
12Sep 15, 2021 17:3484,87288,664,28831,402,66502,260,992