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 3, 2026 17:51Aleksei ShahoikaAleksei ShahoikaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 17:52043,002,67926,322,0001,256,0002,523,136expected "429496549945 ", got "429496549117"
2May 3, 2026 17:5274,57045,860,47426,322,0001,269,0002,514,944
3May 3, 2026 17:5274,95643,428,15126,459,0001,275,0002,527,232