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:28Josu San MartinJosu San MartinScore: 69,230Success
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:2869,17049,088,11124,570,0001,023,0002,355,200
2Jan 13, 2026 00:2869,18453,569,51725,598,00002,338,816
3Jan 13, 2026 00:2869,18954,151,35624,576,0001,024,0002,347,008
4Jan 13, 2026 00:2869,22757,524,06125,614,00002,355,200
5Jan 13, 2026 00:2869,23056,019,79024,591,0001,024,0002,355,200
6Jan 13, 2026 00:2869,39251,003,23825,675,00002,281,472
7Jan 13, 2026 00:2869,45757,333,92025,699,00002,351,104
8Jan 13, 2026 00:2869,83053,391,57323,850,0001,987,0002,355,200
9Jan 13, 2026 00:2870,00353,998,03623,909,0001,992,0002,281,472