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 listOct 19, 2025 12:52Aleksei ShahoikaAleksei ShahoikaScore: 170,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2025 12:52170,56585,738,94261,106,0002,003,0002,260,992
2Oct 19, 2025 12:52170,87885,361,90061,218,0002,007,0002,285,568
3Oct 19, 2025 12:52171,14687,138,08062,319,0001,005,0002,285,568