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 18:41IlyaIlyaError
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 18:42037,168,34426,645,0001,132,0002,113,536expected "429496535872 ", got "429496538641 "
2Jun 25, 2026 18:4274,93536,950,00026,619,0001,107,0002,113,536
3Jun 25, 2026 18:4275,20237,098,02326,639,0001,186,0002,113,536
4Jun 25, 2026 18:4275,35137,237,93226,719,0001,161,0002,113,536
5Jun 25, 2026 18:4275,53537,637,08726,760,0001,188,0002,113,536
6Jun 25, 2026 18:4275,60837,221,06926,836,0001,139,0002,113,536
7Jun 25, 2026 18:4275,79737,336,28626,842,0001,203,0002,113,536
8Jun 25, 2026 18:4276,01337,862,36426,911,0001,214,0002,113,536
9Jun 25, 2026 18:4276,20837,514,41127,071,0001,126,0002,113,536