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 14, 2025 00:20Steve BronderSteve BronderScore: 113,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2025 00:20113,02270,417,16639,827,0001,991,0002,420,736
2Jul 14, 2025 00:20113,12767,266,46441,857,00002,433,024
3Jul 14, 2025 00:20113,15469,478,70739,874,0001,993,0002,428,928