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 3, 2026 13:32IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 13:37032,078,17521,413,0001,118,0002,113,536expected "429496540181 ", got "429496542966 "
2Jul 3, 2026 13:37032,120,50121,481,0001,099,0002,113,536expected "429496544426 ", got "429496546466 "
3Jul 3, 2026 13:37032,439,16921,470,0001,234,0002,113,536expected "429496565248 ", got "429496568391 "
4Jul 3, 2026 13:3760,83232,061,10721,373,0001,135,0002,113,536
5Jul 3, 2026 13:3760,93232,064,77921,424,0001,121,0002,113,536
6Jul 3, 2026 13:3761,12932,642,39221,420,0001,198,0002,113,536
7Jul 3, 2026 13:3761,13232,638,43121,419,0001,200,0002,113,536
8Jul 3, 2026 13:3761,17032,646,61821,412,0001,221,0002,113,536
9Jul 3, 2026 13:3761,40532,279,30221,532,0001,188,0002,113,536