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:16IlyaIlyaScore: 60,270Success
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:1859,88631,676,79421,049,0001,109,0002,113,536
2Jun 30, 2026 18:1859,93531,647,15221,075,0001,101,0002,113,536
3Jun 30, 2026 18:1860,04031,774,14621,028,0001,187,0002,113,536
4Jun 30, 2026 18:1860,09431,717,66121,126,0001,109,0002,113,536
5Jun 30, 2026 18:1860,27031,843,01421,099,0001,201,0002,113,536
6Jun 30, 2026 18:1860,28132,291,98221,117,0001,187,0002,113,536
7Jun 30, 2026 18:1860,31631,776,49821,131,0001,186,0002,113,536
8Jun 30, 2026 18:1860,38332,319,77021,091,0001,251,0002,113,536
9Jun 30, 2026 18:1862,15642,965,94821,729,0001,269,0002,113,536