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 8, 2026 23:45IlyaIlyaScore: 59,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:4659,42131,669,28720,871,0001,115,0002,113,536
2Jul 8, 2026 23:4659,57031,742,33120,924,0001,117,0002,113,536
3Jul 8, 2026 23:4659,60831,746,76720,856,0001,199,0002,113,536
4Jul 8, 2026 23:4659,61831,752,71320,864,0001,195,0002,113,536
5Jul 8, 2026 23:4659,62431,670,15120,932,0001,129,0002,113,536
6Jul 8, 2026 23:4659,64532,351,83420,864,0001,205,0002,113,536
7Jul 8, 2026 23:4659,68631,752,65221,055,0001,029,0002,113,536
8Jul 8, 2026 23:4659,78332,370,63520,911,0001,209,0002,113,536
9Jul 8, 2026 23:4659,78332,121,34820,926,0001,194,0002,113,536