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 30, 2026 18:42Charles CabergsCharles CabergsError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 18:42021,906,92201,594,0002,318,336expected "429496503369 ", got "1 "stderr
2Apr 30, 2026 18:42022,299,74501,645,0002,318,336expected "429496464095 ", got "1 "stderr
3Apr 30, 2026 18:42021,544,17501,546,0002,330,624expected "429496423713 ", got "1 "stderr