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 21, 2023 18:19mmalczakmmalczakScore: 203,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 18:19203,066135,180,14875,134,24002,252,800
2Sep 21, 2023 18:19203,779144,319,16475,398,09902,269,184
3Sep 21, 2023 18:19204,056130,797,81375,500,86202,281,472