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 listMay 12, 2026 01:07Victor MerckléVictor MerckléScore: 65,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:0864,77832,720,22022,957,0001,011,0002,113,536
2May 12, 2026 01:0864,94332,916,02023,022,0001,007,0002,113,536
3May 12, 2026 01:0865,05132,834,40322,983,0001,086,0002,113,536
4May 12, 2026 01:0865,10035,826,17322,992,0001,095,0002,113,536
5May 12, 2026 01:0865,23734,081,53523,043,0001,095,0002,113,536
6May 12, 2026 01:0865,23734,726,72723,060,0001,078,0002,113,536
7May 12, 2026 01:0865,37234,956,96623,169,0001,019,0002,113,536
8May 12, 2026 01:0865,55433,085,03423,185,0001,070,0002,113,536
9May 12, 2026 01:0865,61633,021,61323,174,0001,104,0002,113,536