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:03Victor MerckléVictor MerckléScore: 64,727Success
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:0464,52933,350,20822,796,0001,080,0002,113,536
2May 12, 2026 00:0464,60034,090,75622,816,0001,086,0002,113,536
3May 12, 2026 00:0464,71032,709,57222,850,0001,093,0002,113,536
4May 12, 2026 00:0464,71633,525,24422,830,0001,115,0002,113,536
5May 12, 2026 00:0464,72733,618,07522,865,0001,084,0002,113,536
6May 12, 2026 00:0464,72933,374,25122,853,0001,097,0002,113,536
7May 12, 2026 00:0465,02732,787,43222,975,0001,085,0002,113,536
8May 12, 2026 00:0465,08633,650,27522,983,0001,099,0002,113,536
9May 12, 2026 00:0465,14334,901,27722,997,0001,106,0002,113,536