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 26, 2026 06:59IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 06:59022,328,81212,036,0001,114,0002,113,536expected "429496519161 ", got "429496540336 "
2Jun 26, 2026 06:59022,270,95311,967,0001,125,0002,113,536expected "429496538809 ", got "429496546542 "
3Jun 26, 2026 06:59022,372,97611,980,0001,128,0002,113,536expected "429496440848 ", got "429496465337 "