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 28, 2023 18:10mmalczakmmalczakScore: 69,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 18:1068,89250,769,15025,490,00002,273,280
2Sep 28, 2023 18:1069,04146,202,00525,545,00002,428,928
3Sep 28, 2023 18:1069,23049,710,26325,615,00002,519,040
4Sep 28, 2023 18:1069,25149,283,06425,623,00002,273,280
5Sep 28, 2023 18:1069,28449,700,74225,635,00002,535,424
6Sep 28, 2023 18:1069,39552,602,99525,676,00002,535,424
7Sep 28, 2023 18:1069,46551,085,98325,702,00002,273,280
8Sep 28, 2023 18:1069,89552,694,84124,867,000994,0002,273,280
9Sep 28, 2023 18:1069,94149,587,85524,883,000995,0002,514,944
10Sep 28, 2023 18:1072,34494,541,40926,767,24702,252,800
11Sep 28, 2023 18:1072,40286,322,34426,788,71702,285,568
12Sep 28, 2023 18:1072,43393,694,15026,800,06002,289,664