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:12Yurkov AlekseyYurkov AlekseyScore: 167,373Success
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:12101,912107,831,88637,707,35602,269,184
2Sep 1, 2022 00:12102,97097,193,96738,098,83102,265,088
3Sep 1, 2022 00:12103,172106,467,41338,173,66802,260,992
4Sep 1, 2022 00:12165,70889,092,68459,302,0002,010,0002,289,664
5Sep 1, 2022 00:12166,19285,096,71760,483,0001,008,0002,289,664
6Sep 1, 2022 00:12166,62291,546,98360,640,0001,010,0002,277,376
7Sep 1, 2022 00:12167,37384,288,08959,931,0001,997,0002,527,232
8Sep 1, 2022 00:12167,53087,241,61559,987,0001,999,0002,289,664
9Sep 1, 2022 00:12167,63588,085,93161,025,0001,000,0002,269,184
10Sep 1, 2022 00:12167,64686,831,82660,029,0002,000,0002,289,664
11Sep 1, 2022 00:12167,85788,551,06460,104,0002,003,0002,289,664
12Sep 1, 2022 00:12168,47085,079,15160,324,0002,010,0002,289,664