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 13:40IlyaIlyaScore: 60,048Success
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 13:4159,65631,784,57020,950,0001,123,0002,113,536
2Jul 7, 2026 13:4159,86231,822,35521,048,0001,101,0002,113,536
3Jul 7, 2026 13:4159,99132,383,07420,958,0001,239,0002,113,536
4Jul 7, 2026 13:4160,04031,949,56721,016,0001,199,0002,113,536
5Jul 7, 2026 13:4160,04831,928,57921,008,0001,210,0002,113,536
6Jul 7, 2026 13:4160,09132,486,34220,983,0001,251,0002,113,536
7Jul 7, 2026 13:4160,10232,432,83121,004,0001,234,0002,113,536
8Jul 7, 2026 13:4160,27032,512,41021,077,0001,223,0002,113,536
9Jul 7, 2026 13:4160,27032,496,97021,042,0001,258,0002,113,536