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 listSep 28, 2023 16:58mmalczakmmalczakScore: 70,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 16:5870,21650,880,22624,981,000999,0002,428,928
2Sep 28, 2023 16:5870,27347,525,72224,001,0002,000,0002,273,280
3Sep 28, 2023 16:5870,31148,210,55025,015,0001,000,0002,535,424
4Sep 28, 2023 16:5870,33257,475,52325,023,0001,000,0002,428,928
5Sep 28, 2023 16:5870,37048,419,13525,036,0001,001,0002,428,928
6Sep 28, 2023 16:5870,49749,356,91825,081,0001,003,0002,433,024
7Sep 28, 2023 16:5870,60051,542,66124,113,0002,009,0002,428,928
8Sep 28, 2023 16:5870,71449,398,62426,164,00002,437,120
9Sep 28, 2023 16:5870,80051,824,15525,189,0001,007,0002,437,120
10Sep 28, 2023 16:5873,69194,044,06027,265,76102,273,280
11Sep 28, 2023 16:5873,70987,914,34227,272,30902,289,664
12Sep 28, 2023 16:5874,26390,990,23227,477,36002,269,184