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 02:47Kenneth MaplesKenneth MaplesScore: 73,797Success
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 02:4773,35752,525,09325,132,0002,010,0002,506,752
2Dec 24, 2023 02:4773,37653,588,00127,149,00002,289,664
3Dec 24, 2023 02:4773,49550,208,09525,179,0002,014,0002,342,912
4Dec 24, 2023 02:4773,55748,777,29225,200,0002,016,0002,289,664
5Dec 24, 2023 02:4773,60349,166,20826,225,0001,008,0002,498,560
6Dec 24, 2023 02:4773,68647,315,64326,255,0001,009,0002,285,568
7Dec 24, 2023 02:4773,79753,680,86225,283,0002,022,0002,289,664
8Dec 24, 2023 02:4773,86850,016,20826,319,0001,012,0002,330,624
9Dec 24, 2023 02:4773,92449,958,85626,339,0001,013,0002,289,664
10Dec 24, 2023 02:4776,43198,258,56428,279,51102,215,936
11Dec 24, 2023 02:4776,55399,104,31828,324,78402,232,320
12Dec 24, 2023 02:4776,80594,519,93728,417,99602,220,032