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:22IlyaIlyaError
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:24032,867,95721,570,0001,029,0002,113,536expected "429496526413 ", got "429496523251 "
2Jul 7, 2026 12:2460,45931,983,33121,216,0001,154,0002,113,536
3Jul 7, 2026 12:2460,48931,966,73121,252,0001,129,0002,113,536
4Jul 7, 2026 12:2460,54832,006,25321,186,0001,217,0002,113,536
5Jul 7, 2026 12:2460,56432,074,15321,253,0001,156,0002,113,536
6Jul 7, 2026 12:2460,56432,564,41321,185,0001,224,0002,113,536
7Jul 7, 2026 12:2460,60032,618,62121,208,0001,214,0002,113,536
8Jul 7, 2026 12:2460,62932,579,66521,231,0001,202,0002,113,536
9Jul 7, 2026 12:2460,65632,064,50321,234,0001,209,0002,113,536