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 listOct 17, 2026 09:04KacpxerKacpxerScore: 75,259Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 25, 2026 17:01Andrew Epstein13.29CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 09:0475,00038,630,65326,700,0001,050,0002,113,536
2Oct 17, 2026 09:0475,25938,750,38026,789,0001,057,0002,113,536
3Oct 17, 2026 09:0475,31038,727,52726,813,0001,052,0002,113,536