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:26Aleksei 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:3101,746,907,9311,728,775,0001,135,0002,506,752expected "429496520605 ", got "189467632000"
2May 3, 2026 17:3101,748,147,2451,726,679,0001,003,0002,510,848expected "429496502783 ", got "37991502400"
3May 3, 2026 17:3101,748,830,8651,727,412,0003,009,0002,506,752expected "429496505203 ", got "408107194400"