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 22, 2023 21:31mmalczakmmalczakScore: 73,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2023 21:3173,01155,521,30225,013,0002,001,0002,273,280
2Sep 22, 2023 21:3173,02756,209,16525,019,0002,001,0002,400,256
3Sep 22, 2023 21:3173,10553,302,33225,046,0002,003,0002,281,472
4Sep 22, 2023 21:3173,19251,214,80725,075,0002,006,0002,277,376
5Sep 22, 2023 21:3173,26550,120,50425,100,0002,008,0002,289,664
6Sep 22, 2023 21:3173,30548,475,08326,119,0001,004,0002,277,376
7Sep 22, 2023 21:3173,36551,506,12125,135,0002,010,0002,273,280
8Sep 22, 2023 21:3173,47046,332,22325,171,0002,013,0002,273,280
9Sep 22, 2023 21:3173,53254,247,08526,200,0001,007,0002,387,968
10Sep 22, 2023 21:3175,99299,931,20528,117,05502,260,992
11Sep 22, 2023 21:3176,440104,908,75428,282,77002,265,088
12Sep 22, 2023 21:3176,82488,319,13828,424,77502,260,992