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 22, 2023 08:30mmalczakmmalczakScore: 671,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2023 08:30634,098312,882,355234,616,25202,256,896
2Sep 22, 2023 08:30671,359319,307,551248,402,75502,269,184
3Sep 22, 2023 08:30715,080329,897,852264,579,68802,260,992