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:25Yurkov AlekseyYurkov AlekseyScore: 165,419Success
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:2599,596103,612,76136,850,37902,265,088
2Sep 1, 2022 00:25100,140100,797,88637,051,62902,269,184
3Sep 1, 2022 00:25101,02793,691,24937,380,16202,269,184
4Sep 1, 2022 00:25164,50385,760,41458,871,0001,995,0002,289,664
5Sep 1, 2022 00:25164,55782,439,93558,890,0001,996,0002,289,664
6Sep 1, 2022 00:25164,89281,152,51459,010,0002,000,0002,289,664
7Sep 1, 2022 00:25165,41984,145,31260,202,0001,003,0002,289,664
8Sep 1, 2022 00:25165,61185,499,36159,267,0002,009,0002,289,664
9Sep 1, 2022 00:25165,62789,217,31160,278,0001,004,0002,289,664
10Sep 1, 2022 00:25166,19784,428,13261,493,00002,289,664
11Sep 1, 2022 00:25166,25488,126,80861,514,00002,289,664
12Sep 1, 2022 00:25166,54386,909,99760,611,0001,010,0002,273,280