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:34Aleksei 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:38081,337,49061,302,0001,231,0002,514,944expected "429496504117 ", got "4294966195"
2May 3, 2026 17:38080,796,64761,302,0001,251,0002,519,040expected "429496516764 ", got "2388589436"
3May 3, 2026 17:38080,364,89361,431,0001,243,0002,531,328expected "429496498250 ", got "4294965956"