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 11, 2026 21:28Victor MerckléVictor MerckléScore: 64,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 21:2964,31632,484,83122,792,0001,005,0002,113,536
2May 11, 2026 21:2964,45133,032,84122,838,0001,009,0002,113,536
3May 11, 2026 21:2964,48332,685,26622,783,0001,076,0002,113,536
4May 11, 2026 21:2964,61634,577,08022,805,0001,103,0002,113,536
5May 11, 2026 21:2964,63234,292,48522,841,0001,073,0002,113,536
6May 11, 2026 21:2964,72432,705,27622,858,0001,090,0002,113,536
7May 11, 2026 21:2964,75934,215,14922,959,0001,002,0002,113,536
8May 11, 2026 21:2964,77534,132,65122,924,0001,043,0002,113,536
9May 11, 2026 21:2965,07234,954,35322,985,0001,092,0002,113,536