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 04:22Steve BronderSteve BronderScore: 65,692Success
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 04:2265,40346,823,48022,183,0002,016,0002,424,832
2Jul 15, 2025 04:2265,69246,645,64924,306,00002,433,024
3Jul 15, 2025 04:2265,81948,641,85223,339,0001,014,0002,539,520