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 29, 2026 21:23IlyaIlyaScore: 60,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 21:2559,78931,562,30021,019,0001,103,0002,113,536
2Jun 29, 2026 21:2559,90231,566,46921,075,0001,089,0002,113,536
3Jun 29, 2026 21:2560,04331,587,70121,119,0001,097,0002,113,536
4Jun 29, 2026 21:2560,05131,812,75421,029,0001,190,0002,113,536
5Jun 29, 2026 21:2560,15631,765,57321,129,0001,129,0002,113,536
6Jun 29, 2026 21:2560,32931,774,62921,125,0001,197,0002,113,536
7Jun 29, 2026 21:2560,36231,795,39821,127,0001,207,0002,113,536
8Jun 29, 2026 21:2560,40831,904,07021,232,0001,119,0002,113,536
9Jun 29, 2026 21:2560,79132,001,18921,426,0001,067,0002,113,536