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:41Josu San MartinJosu San MartinScore: 167,559Success
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:41167,47689,982,05259,968,0001,998,0002,285,568
2Dec 30, 2025 00:41167,55991,129,52660,998,000999,0002,285,568
3Dec 30, 2025 00:41167,84682,814,45561,102,0001,001,0002,347,008