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 listJan 17, 2025 05:47Ian MckibbenIan MckibbenError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 05:4700000Error: expected "429496519686 ", got "20710111 4286882217 4644135237536758761 1507601112300012310 7395959508773612931 -8222379425415054820 88949249462239967 88949249462239967 88949249462239967 88949249462239967 267452400 "