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 listSep 13, 2025 20:01Aleksei ShahoikaAleksei ShahoikaScore: 170,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 20:01169,85995,161,14161,851,000997,0002,285,568
2Sep 13, 2025 20:01170,66585,134,71461,142,0002,004,0002,285,568
3Sep 13, 2025 20:01170,89286,119,97862,227,0001,003,0002,260,992