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 listApr 20, 2026 16:37BenBenScore: 151,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:37150,97278,255,0679,975,00045,885,0002,318,336
2Apr 20, 2026 16:37151,32480,288,0466,998,00048,992,0002,314,240
3Apr 20, 2026 16:37152,29485,567,38913,081,00043,268,0002,322,432