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 15, 2021 20:10piculpiculScore: 72,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 20:1071,71151,226,73725,513,0001,020,0002,289,664
2Sep 15, 2021 20:1071,93552,562,88325,593,0001,023,0002,273,280
3Sep 15, 2021 20:1072,01454,564,16925,621,0001,024,0002,289,664
4Sep 15, 2021 20:1072,02756,665,67325,625,0001,025,0002,531,328
5Sep 15, 2021 20:1072,14654,162,02425,668,0001,026,0002,269,184
6Sep 15, 2021 20:1072,36555,422,42425,746,0001,029,0002,281,472
7Sep 15, 2021 20:1072,59256,248,17924,870,0001,989,0002,289,664
8Sep 15, 2021 20:1072,60053,558,49424,873,0001,989,0002,265,088
9Sep 15, 2021 20:1072,62258,134,38325,875,000995,0002,289,664
10Sep 15, 2021 20:1075,284102,254,83027,855,10702,265,088
11Sep 15, 2021 20:1075,34294,549,29727,876,38302,260,992
12Sep 15, 2021 20:1075,85395,525,47228,065,60002,273,280