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:18Kenneth MaplesKenneth MaplesScore: 75,308Success
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:1875,20859,389,62925,840,0001,987,0002,285,568
2Dec 24, 2023 03:1875,21457,793,72426,836,000993,0002,285,568
3Dec 24, 2023 03:1875,23054,047,15425,847,0001,988,0002,285,568
4Dec 24, 2023 03:1875,27655,897,52926,858,000994,0002,498,560
5Dec 24, 2023 03:1875,28159,686,09225,865,0001,989,0002,506,752
6Dec 24, 2023 03:1875,28457,884,81325,866,0001,989,0002,502,656
7Dec 24, 2023 03:1875,30859,554,88226,869,000995,0002,285,568
8Dec 24, 2023 03:1875,39550,889,25925,904,0001,992,0002,494,464
9Dec 24, 2023 03:1875,52454,635,50025,948,0001,996,0002,498,560
10Dec 24, 2023 03:1880,21095,529,04729,677,82202,215,936
11Dec 24, 2023 03:1880,29594,116,11429,709,28902,220,032
12Dec 24, 2023 03:1880,928105,034,96229,943,38602,232,320