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:21Josu San MartinJosu San MartinScore: 69,873Success
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:2169,36551,845,99624,639,0001,026,0002,347,008
2Jan 13, 2026 00:2169,50358,504,06125,716,00002,281,472
3Jan 13, 2026 00:2169,72757,412,25024,807,000992,0002,351,104
4Jan 13, 2026 00:2169,84357,725,57224,849,000993,0002,351,104
5Jan 13, 2026 00:2169,87352,312,70923,865,0001,988,0002,281,472
6Jan 13, 2026 00:2169,93251,199,16823,885,0001,990,0002,355,200
7Jan 13, 2026 00:2169,93250,215,90824,880,000995,0002,281,472
8Jan 13, 2026 00:2169,94952,216,44823,891,0001,990,0002,347,008
9Jan 13, 2026 00:2170,08950,409,94724,936,000997,0002,351,104