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 09:35IlyaIlyaScore: 61,089Success
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 09:3660,59731,937,34021,313,0001,108,0002,113,536
2Jun 30, 2026 09:3660,91832,093,43221,330,0001,210,0002,113,536
3Jun 30, 2026 09:3660,94532,459,22821,337,0001,213,0002,113,536
4Jun 30, 2026 09:3660,94832,012,12321,367,0001,184,0002,113,536
5Jun 30, 2026 09:3661,08932,486,89621,401,0001,202,0002,113,536
6Jun 30, 2026 09:3661,10532,113,35021,395,0001,214,0002,113,536
7Jun 30, 2026 09:3661,12732,453,66121,406,0001,211,0002,113,536
8Jun 30, 2026 09:3661,13732,586,42021,399,0001,222,0002,113,536
9Jun 30, 2026 09:3661,22732,619,74221,448,0001,206,0002,113,536