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 02:41Josu San MartinJosu San MartinScore: 70,416Success
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 02:4170,24951,405,76623,993,0001,999,0002,293,760
2Jan 13, 2026 02:4170,41652,100,65824,050,0002,004,0002,523,136
3Jan 13, 2026 02:4170,56251,510,83325,104,0001,004,0002,285,568