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 listAug 28, 2023 20:28Franek KortaFranek KortaScore: 91,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 20:2890,58452,194,80032,501,0001,015,0002,269,184
2Aug 28, 2023 20:2890,62454,096,48432,515,0001,016,0002,531,328
3Aug 28, 2023 20:2890,74956,144,57433,577,00002,265,088
4Aug 28, 2023 20:2890,90859,575,38031,598,0002,038,0002,531,328
5Aug 28, 2023 20:2890,99262,470,26533,667,00002,531,328
6Aug 28, 2023 20:2891,11957,307,29733,714,00002,531,328
7Aug 28, 2023 20:2891,50558,628,59730,870,0002,987,0002,269,184
8Aug 28, 2023 20:2891,53864,338,23133,869,00002,441,216
9Aug 28, 2023 20:2891,54156,105,85332,874,000996,0002,428,928
10Aug 28, 2023 20:28103,651112,818,50038,350,95702,285,568
11Aug 28, 2023 20:28103,707116,889,08038,371,77102,220,032
12Aug 28, 2023 20:28104,237107,273,53438,567,61702,297,856