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:32IlyaIlyaScore: 58,500Success
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:3758,22931,242,55720,446,0001,099,0002,113,536
2Jul 8, 2026 23:3758,25631,290,71220,445,0001,110,0002,113,536
3Jul 8, 2026 23:3758,36231,286,28120,484,0001,110,0002,113,536
4Jul 8, 2026 23:3758,39131,231,17020,498,0001,107,0002,113,536
5Jul 8, 2026 23:3758,50031,284,50420,531,0001,114,0002,113,536
6Jul 8, 2026 23:3758,59131,411,71120,486,0001,193,0002,113,536
7Jul 8, 2026 23:3758,61831,462,71820,533,0001,156,0002,113,536
8Jul 8, 2026 23:3758,80031,443,50620,678,0001,078,0002,113,536
9Jul 8, 2026 23:3758,86731,518,92520,520,0001,261,0002,113,536