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 25, 2026 17:19IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 17:20037,462,27827,096,0001,106,0002,113,536expected "429496507488 ", got "4294745645 "
2Jun 25, 2026 17:20035,311,90724,853,0001,198,0002,113,536expected "429496562589 ", got "4294800285 "
3Jun 25, 2026 17:20037,566,18827,114,0001,190,0002,113,536expected "429496508549 ", got "4294746290 "