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 listJan 13, 2026 00:25Josu San MartinJosu San MartinScore: 69,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 00:2569,03248,253,12625,542,00002,359,296
2Jan 13, 2026 00:2569,48655,505,72725,710,00002,281,472
3Jan 13, 2026 00:2569,86252,218,90423,861,0001,988,0002,355,200