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 listJul 15, 2025 05:20Steve BronderSteve BronderScore: 65,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 05:2065,12245,646,29524,095,00002,424,832
2Jul 15, 2025 05:2065,21952,696,99123,126,0001,005,0002,428,928
3Jul 15, 2025 05:2065,47651,919,27923,217,0001,009,0002,416,640