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 1, 2022 00:16Yurkov AlekseyYurkov AlekseyScore: 167,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2022 00:16101,402109,221,36037,518,64102,265,088
2Sep 1, 2022 00:16101,418114,270,74237,524,50602,252,800
3Sep 1, 2022 00:16102,364143,370,33337,874,68002,269,184
4Sep 1, 2022 00:16166,57387,588,81860,622,0001,010,0002,289,664
5Sep 1, 2022 00:16166,64390,112,47060,648,0001,010,0002,277,376
6Sep 1, 2022 00:16167,15992,770,20859,854,0001,995,0002,289,664
7Sep 1, 2022 00:16167,16885,807,51761,852,00002,289,664
8Sep 1, 2022 00:16167,35785,880,76959,925,0001,997,0002,289,664
9Sep 1, 2022 00:16167,43085,544,45358,952,0002,997,0002,531,328
10Sep 1, 2022 00:16167,43284,986,63959,952,0001,998,0002,273,280
11Sep 1, 2022 00:16167,49287,166,45760,973,000999,0002,289,664
12Sep 1, 2022 00:16167,61484,260,24660,017,0002,000,0002,289,664