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 listOct 24, 2022 23:36Kenneth MaplesKenneth MaplesScore: 75,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2022 23:3675,29752,135,80223,880,0003,980,0002,498,560
2Oct 24, 2022 23:3675,36849,764,46025,821,0002,065,0002,502,656
3Oct 24, 2022 23:3675,45751,510,27225,925,0001,994,0002,277,376
4Oct 24, 2022 23:3675,45751,200,71425,925,0001,994,0002,277,376
5Oct 24, 2022 23:3675,57652,281,73724,967,0002,996,0002,498,560
6Oct 24, 2022 23:3675,61154,034,77225,978,0001,998,0002,277,376
7Oct 24, 2022 23:3675,69550,614,06023,006,0005,001,0002,506,752
8Oct 24, 2022 23:3675,76252,170,08326,030,0002,002,0002,277,376
9Oct 24, 2022 23:3675,82751,077,73826,052,0002,004,0002,277,376
10Oct 24, 2022 23:3679,94298,072,83029,578,58002,220,032
11Oct 24, 2022 23:3680,349100,485,35929,728,95102,228,224
12Oct 24, 2022 23:3680,594101,304,62429,819,66802,236,416