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 3, 2021 15:22Ilya AniskovetsIlya AniskovetsScore: 117,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2021 15:22115,43869,326,24741,696,0001,016,0002,289,664
2Sep 3, 2021 15:22115,77872,218,95740,846,0001,992,0002,289,664
3Sep 3, 2021 15:22116,55168,898,45441,119,0002,005,0002,289,664
4Sep 3, 2021 15:22116,55970,305,35741,122,0002,005,0002,289,664
5Sep 3, 2021 15:22116,67068,415,97441,161,0002,007,0002,289,664
6Sep 3, 2021 15:22116,92266,710,01141,249,0002,012,0002,371,584
7Sep 3, 2021 15:22117,54374,742,07142,480,0001,011,0002,289,664
8Sep 3, 2021 15:22118,55771,609,90741,873,0001,993,0002,527,232
9Sep 3, 2021 15:22119,53564,663,32042,218,0002,010,0002,379,776
10Sep 3, 2021 15:22121,908115,287,59045,105,86402,256,896
11Sep 3, 2021 15:22122,063110,048,13645,163,28402,273,280
12Sep 3, 2021 15:22122,197114,047,26745,212,70502,256,896