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:35Victor MerckléVictor MerckléScore: 65,597Success
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:3665,24335,732,77623,083,0001,057,0002,113,536
2May 11, 2026 21:3665,35935,013,89323,085,0001,098,0002,113,536
3May 11, 2026 21:3665,36232,959,53823,084,0001,100,0002,113,536
4May 11, 2026 21:3665,42734,220,20323,149,0001,059,0002,113,536
5May 11, 2026 21:3665,59733,387,39023,137,0001,134,0002,113,536
6May 11, 2026 21:3665,70234,025,21823,251,0001,059,0002,113,536
7May 11, 2026 21:3665,77835,302,57423,260,0001,078,0002,113,536
8May 11, 2026 21:3665,79433,268,01723,250,0001,094,0002,113,536
9May 11, 2026 21:3666,05133,204,31323,300,0001,139,0002,113,536