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 13:10IlyaIlyaScore: 64,689Success
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 13:1364,22433,289,40622,662,0001,101,0002,113,536
2Jun 29, 2026 13:1364,31033,325,23822,671,0001,124,0002,113,536
3Jun 29, 2026 13:1364,45433,772,29222,659,0001,189,0002,113,536
4Jun 29, 2026 13:1364,47833,377,03422,674,0001,183,0002,113,536
5Jun 29, 2026 13:1364,68933,390,06322,824,0001,111,0002,113,536
6Jun 29, 2026 13:1364,70533,842,70222,738,0001,203,0002,113,536
7Jun 29, 2026 13:1364,81833,556,50122,797,0001,186,0002,113,536
8Jun 29, 2026 13:1364,84033,894,40422,748,0001,243,0002,113,536
9Jun 29, 2026 13:1364,99433,929,31722,841,0001,207,0002,113,536