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:33IlyaIlyaScore: 59,451Success
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:3459,12931,380,01020,769,0001,109,0002,113,536
2Jun 29, 2026 21:3459,27231,540,95920,760,0001,171,0002,113,536
3Jun 29, 2026 21:3459,30831,789,38620,777,0001,167,0002,113,536
4Jun 29, 2026 21:3459,33531,427,12720,779,0001,175,0002,113,536
5Jun 29, 2026 21:3459,45131,493,70820,816,0001,181,0002,113,536
6Jun 29, 2026 21:3459,50531,975,29320,835,0001,182,0002,113,536
7Jun 29, 2026 21:3459,56431,907,26720,814,0001,225,0002,113,536
8Jun 29, 2026 21:3459,64532,006,56420,867,0001,202,0002,113,536
9Jun 29, 2026 21:3459,78631,608,97920,932,0001,189,0002,117,632