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 18:17IlyaIlyaScore: 60,240Success
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 18:2159,96731,662,47921,031,0001,157,0002,113,536
2Jun 30, 2026 18:2160,03531,748,89821,072,0001,141,0002,113,536
3Jun 30, 2026 18:2160,05131,629,61021,042,0001,177,0002,113,536
4Jun 30, 2026 18:2160,16231,675,19421,153,0001,107,0002,113,536
5Jun 30, 2026 18:2160,24031,761,73921,105,0001,184,0002,113,536
6Jun 30, 2026 18:2160,25632,235,73121,118,0001,177,0002,113,536
7Jun 30, 2026 18:2160,35431,851,12721,270,0001,061,0002,113,536
8Jun 30, 2026 18:2160,50232,287,25421,161,0001,225,0002,113,536
9Jun 30, 2026 18:2160,63733,270,34621,222,0001,214,0002,113,536