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:29Josu San MartinJosu San MartinScore: 69,232Success
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:2969,14158,119,69225,582,00002,355,200
2Jan 13, 2026 00:2969,23250,919,15425,616,00002,351,104
3Jan 13, 2026 00:2969,83558,771,57024,846,000993,0002,281,472