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 8, 2026 23:15IlyaIlyaScore: 58,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:1758,22131,221,31020,424,0001,118,0002,113,536
2Jul 8, 2026 23:1758,38631,235,89220,488,0001,115,0002,113,536
3Jul 8, 2026 23:1758,42931,304,99220,489,0001,130,0002,113,536
4Jul 8, 2026 23:1758,51831,351,67120,539,0001,113,0002,113,536
5Jul 8, 2026 23:1758,66731,431,66720,515,0001,192,0002,113,536
6Jul 8, 2026 23:1758,72731,950,79520,540,0001,189,0002,113,536
7Jul 8, 2026 23:1721,465,5167,952,471,9427,791,492,000150,749,0002,113,536
8Jul 8, 2026 23:1721,585,7867,997,044,3337,836,144,000150,597,0002,113,536
9Jul 8, 2026 23:1721,699,7728,040,937,4797,881,554,000147,362,0002,113,536