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 10:45Steve BronderSteve BronderScore: 68,876Success
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 10:4568,73850,870,81324,416,0001,017,0002,277,376
2Jun 19, 2025 10:4568,87651,407,42224,465,0001,019,0002,539,520
3Jun 19, 2025 10:4569,87050,835,32024,858,000994,0002,539,520