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:57mmalczakmmalczakScore: 70,592Success
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:5770,41650,990,81425,052,0001,002,0002,535,424
2Sep 28, 2023 16:5770,48152,314,95324,072,0002,006,0002,428,928
3Sep 28, 2023 16:5770,48654,580,04125,077,0001,003,0002,424,832
4Sep 28, 2023 16:5770,48947,527,33225,078,0001,003,0002,535,424
5Sep 28, 2023 16:5770,49749,061,00825,081,0001,003,0002,273,280
6Sep 28, 2023 16:5770,51146,348,51925,086,0001,003,0002,535,424
7Sep 28, 2023 16:5770,59248,219,29024,110,0002,009,0002,420,736
8Sep 28, 2023 16:5770,81146,820,60025,193,0001,007,0002,273,280
9Sep 28, 2023 16:5770,85448,606,78425,208,0001,008,0002,535,424
10Sep 28, 2023 16:5773,41170,904,23527,162,11602,248,704
11Sep 28, 2023 16:5773,90697,759,33227,345,27002,265,088
12Sep 28, 2023 16:5773,92297,921,89527,351,21302,273,280