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 18, 2023 13:03mmalczakmmalczakScore: 92,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2023 13:0391,74358,696,27631,949,0001,996,0002,277,376
2Sep 18, 2023 13:0392,03060,769,98532,048,0002,003,0002,277,376
3Sep 18, 2023 13:0392,20861,189,58733,114,0001,003,0002,531,328
4Sep 18, 2023 13:0392,25160,364,62831,122,0003,011,0002,277,376
5Sep 18, 2023 13:0392,25161,575,45434,133,00002,277,376
6Sep 18, 2023 13:0392,28966,580,94131,134,0003,013,0002,273,280
7Sep 18, 2023 13:0392,30357,504,77334,152,00002,277,376
8Sep 18, 2023 13:0392,72461,874,55232,290,0002,018,0002,277,376
9Sep 18, 2023 13:0394,44952,964,66332,950,0001,996,0002,277,376
10Sep 18, 2023 13:0395,58997,531,64335,367,83902,273,280
11Sep 18, 2023 13:0396,07498,282,62135,547,40102,265,088
12Sep 18, 2023 13:0396,817106,281,82035,822,36302,269,184