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,164Success
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:1959,90231,594,16321,067,0001,097,0002,113,536
2Jun 30, 2026 18:1959,93731,728,25121,074,0001,103,0002,113,536
3Jun 30, 2026 18:1960,12932,331,71021,067,0001,181,0002,113,536
4Jun 30, 2026 18:1960,16231,730,38321,159,0001,101,0002,113,536
5Jun 30, 2026 18:1960,16431,804,03521,061,0001,200,0002,113,536
6Jun 30, 2026 18:1960,24831,820,17021,104,0001,188,0002,113,536
7Jun 30, 2026 18:1960,29732,260,99421,090,0001,220,0002,113,536
8Jun 30, 2026 18:1960,42732,272,18721,114,0001,244,0002,113,536
9Jun 30, 2026 18:1960,50032,344,20621,178,0001,207,0002,113,536