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 listOct 9, 2026 08:48Karthik ReddyKarthik ReddyScore: 53,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 09:4653,6276,029,103,12219,842,000020,480
2Oct 9, 2026 09:4653,7136,029,083,93119,874,000020,480
3Oct 9, 2026 09:4653,7596,029,046,98119,891,000020,480
4Oct 9, 2026 09:4653,7726,029,094,33819,896,000020,480
5Oct 9, 2026 09:4653,7836,029,095,28919,900,000020,480
6Oct 9, 2026 09:4653,8706,030,903,07719,932,000020,480
7Oct 9, 2026 09:4653,9376,029,279,96119,957,000020,480
8Oct 9, 2026 09:4653,9646,029,143,97419,967,000020,480
9Oct 9, 2026 09:4654,3456,029,381,11820,108,000020,480