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 29, 2026 20:29IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 20:29031,933,77421,369,0001,142,0002,113,536expected "429496550910 ", got "429496551600 "
2Jun 29, 2026 20:29031,798,03921,252,0001,116,0002,113,536expected "429496507423 ", got "429496511496 "
3Jun 29, 2026 20:29031,937,40721,314,0001,186,0002,113,536expected "429496527409 ", got "429496530785 "