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 22:39IlyaIlyaScore: 59,043Success
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 22:4158,65431,152,82020,603,0001,099,0002,113,536
2Jun 30, 2026 22:4158,73531,144,03220,615,0001,117,0002,113,536
3Jun 30, 2026 22:4158,75431,214,75820,638,0001,101,0002,113,536
4Jun 30, 2026 22:4158,94531,255,46620,690,0001,120,0002,113,536
5Jun 30, 2026 22:4159,04331,758,36320,661,0001,185,0002,113,536
6Jun 30, 2026 22:4159,04333,055,06620,634,0001,212,0002,113,536
7Jun 30, 2026 22:4159,05931,740,43420,647,0001,205,0002,113,536
8Jun 30, 2026 22:4159,27831,935,59320,707,0001,226,0002,113,536
9Jun 30, 2026 22:4159,28331,922,88620,731,0001,204,0002,113,536