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 5, 2026 07:58Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 07:59018,978,03502,208,0002,523,136expected "429496549897 ", got "0 "stderr
2May 5, 2026 07:59021,499,07602,382,0002,519,040expected "429496452236 ", got "0 "stderr
3May 5, 2026 07:59016,527,64002,253,0002,519,040expected "429496524735 ", got "0 "stderr