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:23mmalczakmmalczakScore: 199,809Success
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:23198,272134,848,63873,360,74002,260,992
2Sep 21, 2023 18:23199,809134,561,03573,929,35902,265,088
3Sep 21, 2023 18:23200,684137,796,76174,253,02202,252,800