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:38Kenneth MaplesKenneth MaplesScore: 75,500Success
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:3874,75757,636,10027,660,00002,285,568
2Dec 24, 2023 03:3875,21456,286,45925,842,0001,987,0002,502,656
3Dec 24, 2023 03:3875,23254,912,94725,848,0001,988,0002,285,568
4Dec 24, 2023 03:3875,23253,109,78025,848,0001,988,0002,502,656
5Dec 24, 2023 03:3875,43552,637,01225,918,0001,993,0002,285,568
6Dec 24, 2023 03:3875,45750,922,97125,925,0001,994,0002,285,568
7Dec 24, 2023 03:3875,50050,450,63325,940,0001,995,0002,285,568
8Dec 24, 2023 03:3875,64655,929,22425,990,0001,999,0002,506,752
9Dec 24, 2023 03:3875,73055,951,93827,020,0001,000,0002,285,568
10Dec 24, 2023 03:3879,85688,227,17629,546,86602,220,032
11Dec 24, 2023 03:3880,01797,092,17229,606,29102,220,032
12Dec 24, 2023 03:3880,05687,664,87129,620,81802,220,032