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 listJun 19, 2025 10:39Steve BronderSteve BronderScore: 68,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2025 10:3968,05745,897,04823,167,0002,014,0002,437,120
2Jun 19, 2025 10:3968,70050,298,80824,403,0001,016,0002,428,928
3Jun 19, 2025 10:3968,85947,733,12624,459,0001,019,0002,433,024