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:47mmalczakmmalczakScore: 74,685Success
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:4774,21988,287,17627,461,01802,273,280
2Sep 25, 2023 21:4774,68592,604,81527,633,27302,260,992
3Sep 25, 2023 21:4774,74596,992,22927,655,47002,269,184