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 15, 2025 11:23Steve BronderSteve BronderScore: 68,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2025 11:2368,34949,693,89425,289,00002,539,520
2Jun 15, 2025 11:2368,40353,290,69825,309,00002,428,928
3Jun 15, 2025 11:2368,77052,997,67824,428,0001,017,0002,277,376