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 00:43Victor MerckléVictor MerckléScore: 64,578Success
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 00:4464,45434,681,19522,802,0001,046,0002,113,536
2May 12, 2026 00:4464,46732,584,45622,837,0001,016,0002,113,536
3May 12, 2026 00:4464,50033,975,69722,862,0001,003,0002,113,536
4May 12, 2026 00:4464,57834,158,98122,812,0001,082,0002,113,536
5May 12, 2026 00:4464,57832,564,34122,813,0001,081,0002,113,536
6May 12, 2026 00:4464,64535,614,93222,825,0001,094,0002,113,536
7May 12, 2026 00:4464,78332,708,13922,921,0001,049,0002,113,536
8May 12, 2026 00:4464,94335,119,89723,000,0001,029,0002,113,536
9May 12, 2026 00:4465,00233,306,71523,027,0001,024,0002,113,536