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 listApr 21, 2025 02:49Steve BronderSteve BronderScore: 81,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 02:4980,86251,029,09728,922,000997,0002,437,120
2Apr 21, 2025 02:4981,35957,902,61229,100,0001,003,0002,531,328
3Apr 21, 2025 02:4982,04653,678,73929,346,0001,011,0002,527,232