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 20, 2026 20:14A_ShamanA_ShamanScore: 113,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 20:15113,08350,856,89040,803,0001,038,0002,113,536
2Jun 20, 2026 20:15113,31850,966,09340,887,0001,041,0002,113,536
3Jun 20, 2026 20:15113,56251,061,22140,941,0001,077,0002,113,536
4Jun 20, 2026 20:15113,56251,022,80340,937,0001,081,0002,113,536
5Jun 20, 2026 20:15113,95951,245,64441,082,0001,083,0002,113,536
6Jun 20, 2026 20:15114,21051,390,55141,182,0001,076,0002,113,536
7Jun 20, 2026 20:15114,35952,632,58241,212,0001,101,0002,113,536
8Jun 20, 2026 20:15114,40551,362,06141,254,0001,076,0002,113,536
9Jun 20, 2026 20:15114,94051,551,81141,447,0001,081,0002,113,536