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 listDec 30, 2025 00:31Josu San MartinJosu San MartinScore: 176,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 00:31176,46886,535,98263,284,0002,009,0002,359,296
2Dec 30, 2025 00:31176,77090,887,00765,405,00002,359,296
3Dec 30, 2025 00:31177,35993,372,21064,614,0001,009,0002,285,568