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 listJul 7, 2026 12:30IlyaIlyaScore: 62,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:3162,25632,626,74321,892,0001,143,0002,113,536
2Jul 7, 2026 12:3162,26733,297,37321,826,0001,213,0002,113,536
3Jul 7, 2026 12:3162,27032,597,67922,015,0001,025,0002,113,536
4Jul 7, 2026 12:3162,31832,584,41821,900,0001,158,0002,113,536
5Jul 7, 2026 12:3162,45932,831,84721,907,0001,203,0002,113,536
6Jul 7, 2026 12:3162,45932,700,45321,920,0001,190,0002,113,536
7Jul 7, 2026 12:3162,49433,394,78821,922,0001,201,0002,113,536
8Jul 7, 2026 12:3162,54333,381,08721,893,0001,248,0002,113,536
9Jul 7, 2026 12:3162,89733,443,08622,029,0001,243,0002,113,536