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 29, 2021 16:29piculpiculScore: 72,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2021 16:2970,51792,267,64426,091,11402,260,992
2Sep 29, 2021 16:2970,57291,536,14526,111,45602,273,280
3Sep 29, 2021 16:2970,822101,182,36326,204,26202,269,184
4Sep 29, 2021 16:2972,03557,536,81226,653,00002,273,280
5Sep 29, 2021 16:2972,48655,179,33524,834,0001,986,0002,289,664
6Sep 29, 2021 16:2972,53054,045,82525,843,000993,0002,289,664
7Sep 29, 2021 16:2972,56852,069,29425,856,000994,0002,289,664
8Sep 29, 2021 16:2972,58156,680,01224,866,0001,989,0002,289,664
9Sep 29, 2021 16:2972,63850,268,82024,886,0001,990,0002,355,200
10Sep 29, 2021 16:2972,67357,216,92524,898,0001,991,0002,289,664
11Sep 29, 2021 16:2972,70851,382,36825,906,000996,0002,281,472
12Sep 29, 2021 16:2973,02248,383,74925,017,0002,001,0002,383,872