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:20Yurkov AlekseyYurkov AlekseyScore: 167,295Success
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:20101,340101,470,31137,495,89702,265,088
2Sep 1, 2022 00:20101,88393,825,18937,696,75202,252,800
3Sep 1, 2022 00:20103,363111,103,16038,244,17002,265,088
4Sep 1, 2022 00:20166,48492,967,39960,590,0001,009,0002,289,664
5Sep 1, 2022 00:20166,95783,941,39059,782,0001,992,0002,289,664
6Sep 1, 2022 00:20167,15988,226,07160,852,000997,0002,289,664
7Sep 1, 2022 00:20167,29583,358,51560,901,000998,0002,281,472
8Sep 1, 2022 00:20167,40883,385,75659,943,0001,998,0002,371,584
9Sep 1, 2022 00:20167,47684,324,91359,968,0001,998,0002,273,280
10Sep 1, 2022 00:20167,67085,122,83161,038,0001,000,0002,289,664
11Sep 1, 2022 00:20168,06589,071,84760,179,0002,005,0002,523,136
12Sep 1, 2022 00:20168,11983,656,30860,198,0002,006,0002,289,664