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 listJul 2, 2026 23:21A_ShamanA_ShamanScore: 70,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 23:2169,81335,414,46024,760,0001,071,0002,113,536
2Jul 2, 2026 23:2170,04835,733,44224,765,0001,153,0002,113,536
3Jul 2, 2026 23:2170,08135,874,89224,759,0001,171,0002,113,536
4Jul 2, 2026 23:2170,12735,976,29124,748,0001,199,0002,113,536
5Jul 2, 2026 23:2170,21336,000,33224,799,0001,180,0002,113,536
6Jul 2, 2026 23:2170,21835,577,72224,804,0001,177,0002,113,536
7Jul 2, 2026 23:2170,23735,985,24324,789,0001,199,0002,113,536
8Jul 2, 2026 23:2170,41336,122,25124,836,0001,217,0002,113,536
9Jul 2, 2026 23:2170,44836,077,88724,843,0001,223,0002,113,536