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 listDec 24, 2023 03:11Kenneth MaplesKenneth MaplesScore: 73,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 03:1173,25951,254,48926,103,0001,003,0002,285,568
2Dec 24, 2023 03:1173,27850,471,76826,109,0001,004,0002,502,656
3Dec 24, 2023 03:1173,32251,584,88825,120,0002,009,0002,502,656
4Dec 24, 2023 03:1173,39553,509,60026,151,0001,005,0002,285,568
5Dec 24, 2023 03:1173,43252,846,49725,158,0002,012,0002,285,568
6Dec 24, 2023 03:1173,55954,091,54125,201,0002,016,0002,338,816
7Dec 24, 2023 03:1173,62251,746,01726,232,0001,008,0002,506,752
8Dec 24, 2023 03:1173,67049,873,78325,239,0002,019,0002,342,912
9Dec 24, 2023 03:1173,77851,049,28325,276,0002,022,0002,506,752
10Dec 24, 2023 03:1176,20492,395,01728,195,43702,220,032
11Dec 24, 2023 03:1176,555103,383,28428,325,22002,215,936
12Dec 24, 2023 03:1176,69493,725,33728,376,77602,220,032