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 12, 2026 20:17Josu San MartinJosu San MartinScore: 72,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 20:1771,76248,839,44325,531,0001,021,0002,367,488
2Jan 12, 2026 20:1772,05453,200,62226,660,00002,371,584
3Jan 12, 2026 20:1772,54358,151,40625,847,000994,0002,363,392