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:51Kenneth MaplesKenneth MaplesScore: 74,557Success
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:5173,98952,740,80425,349,0002,027,0002,506,752
2Dec 24, 2023 02:5174,03256,178,62425,363,0002,029,0002,502,656
3Dec 24, 2023 02:5174,14950,173,49526,419,0001,016,0002,347,008
4Dec 24, 2023 02:5174,27848,748,33326,466,0001,017,0002,502,656
5Dec 24, 2023 02:5174,28159,575,97125,521,0001,963,0002,289,664
6Dec 24, 2023 02:5174,54357,338,82227,581,00002,506,752
7Dec 24, 2023 02:5174,55758,258,80526,565,0001,021,0002,289,664
8Dec 24, 2023 02:5174,56255,381,34826,567,0001,021,0002,498,560
9Dec 24, 2023 02:5174,66552,918,53727,626,00002,289,664
10Dec 24, 2023 02:5177,186105,665,05328,558,88902,232,320
11Dec 24, 2023 02:5177,52194,065,29828,682,87602,232,320
12Dec 24, 2023 02:5177,78694,866,09328,780,95202,228,224