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 listAug 6, 2022 20:04Franek KortaFranek KortaScore: 75,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 20:0474,47355,143,56625,514,0002,041,0002,281,472
2Aug 6, 2022 20:0474,53256,173,92825,535,0002,042,0002,281,472
3Aug 6, 2022 20:0474,58951,346,56424,532,0003,066,0002,535,424
4Aug 6, 2022 20:0474,65152,261,50827,621,00002,535,424
5Aug 6, 2022 20:0474,67054,711,12026,605,0001,023,0002,367,488
6Aug 6, 2022 20:0474,73061,207,15426,626,0001,024,0002,281,472
7Aug 6, 2022 20:0475,24655,777,53924,858,0002,983,0002,281,472
8Aug 6, 2022 20:0475,26256,779,00425,858,0001,989,0002,281,472
9Aug 6, 2022 20:0475,29753,798,61226,865,000995,0002,277,376
10Aug 6, 2022 20:0478,67492,117,27229,109,26002,252,800
11Aug 6, 2022 20:0479,20397,304,24029,305,17402,265,088
12Aug 6, 2022 20:0479,278105,492,14929,333,01302,256,896