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 listJun 19, 2025 11:03Steve BronderSteve BronderScore: 68,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2025 11:0368,70847,712,27925,422,00002,539,520
2Jun 19, 2025 11:0368,84951,611,48125,474,00002,539,520
3Jun 19, 2025 11:0368,95948,035,20225,515,00002,424,832