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 19:24IlyaIlyaScore: 60,305Success
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 19:2560,09431,701,36621,112,0001,123,0002,113,536
2Jun 29, 2026 19:2560,10831,693,85021,110,0001,130,0002,113,536
3Jun 29, 2026 19:2560,13731,727,02421,143,0001,108,0002,113,536
4Jun 29, 2026 19:2560,26433,624,38921,095,0001,203,0002,113,536
5Jun 29, 2026 19:2560,30532,246,82321,106,0001,207,0002,113,536
6Jun 29, 2026 19:2560,37031,868,76121,134,0001,203,0002,113,536
7Jun 29, 2026 19:2560,39431,873,55721,151,0001,195,0002,113,536
8Jun 29, 2026 19:2560,46432,224,63221,163,0001,209,0002,113,536
9Jun 29, 2026 19:2560,49131,936,93821,176,0001,206,0002,113,536