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 16, 2023 11:13mmalczakmmalczakScore: 99,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 11:1397,19563,540,91833,965,0001,997,0002,273,280
2Sep 16, 2023 11:1397,59759,712,19434,105,0002,006,0002,523,136
3Sep 16, 2023 11:1397,77858,670,07635,174,0001,004,0002,289,664
4Sep 16, 2023 11:1397,84959,999,00534,193,0002,011,0002,289,664
5Sep 16, 2023 11:1398,25464,166,45134,335,0002,019,0002,289,664
6Sep 16, 2023 11:1398,89768,970,79336,592,00002,269,184
7Sep 16, 2023 11:1399,04163,952,28435,628,0001,017,0002,342,912
8Sep 16, 2023 11:1399,18962,992,52835,681,0001,019,0002,531,328
9Sep 16, 2023 11:1399,57665,761,18035,848,000995,0002,289,664
10Sep 16, 2023 11:1399,58497,244,35236,846,04602,269,184
11Sep 16, 2023 11:1399,773101,521,38036,916,03202,269,184
12Sep 16, 2023 11:13100,64193,183,92637,237,16302,252,800