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:35IlyaIlyaScore: 59,743Success
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:3659,50031,443,00620,902,0001,113,0002,113,536
2Jun 29, 2026 19:3659,67531,524,62720,894,0001,186,0002,113,536
3Jun 29, 2026 19:3659,67531,576,07620,934,0001,146,0002,113,536
4Jun 29, 2026 19:3659,67831,449,24920,975,0001,106,0002,113,536
5Jun 29, 2026 19:3659,74331,486,85021,004,0001,101,0002,113,536
6Jun 29, 2026 19:3659,83731,603,00121,041,0001,099,0002,113,536
7Jun 29, 2026 19:3659,84331,578,85520,942,0001,200,0002,113,536
8Jun 29, 2026 19:3659,97232,129,01420,980,0001,210,0002,113,536
9Jun 29, 2026 19:3660,10232,198,46521,047,0001,191,0002,113,536