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 30, 2026 21:22IlyaIlyaScore: 60,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 21:2360,39132,282,98121,162,0001,183,0002,113,536
2Jun 30, 2026 21:2360,42131,800,02121,176,0001,180,0002,113,536
3Jun 30, 2026 21:2360,43531,905,08621,150,0001,211,0002,113,536
4Jun 30, 2026 21:2360,43732,321,04321,174,0001,188,0002,113,536
5Jun 30, 2026 21:2360,48632,303,23021,177,0001,203,0002,113,536
6Jun 30, 2026 21:2360,67032,319,14521,243,0001,205,0002,113,536
7Jun 30, 2026 21:2360,73231,962,29321,418,0001,053,0002,113,536
8Jun 30, 2026 21:2360,77832,355,14721,276,0001,212,0002,113,536
9Jun 30, 2026 21:2360,92932,486,30221,330,0001,214,0002,113,536