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 25, 2023 21:53mmalczakmmalczakScore: 75,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2023 21:5374,95792,935,18627,734,24002,252,800
2Sep 25, 2023 21:5375,34392,263,32727,876,76002,265,088
3Sep 25, 2023 21:5375,698100,674,67028,008,31602,277,376