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 12, 2026 21:57IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 21:58031,378,99120,693,0001,027,0002,113,536expected "429496527186 ", got "429496525712 "
2Jul 12, 2026 21:5858,21031,128,29220,433,0001,105,0002,113,536
3Jul 12, 2026 21:5858,27031,224,52120,469,0001,091,0002,113,536
4Jul 12, 2026 21:5858,29431,257,00620,462,0001,107,0002,113,536
5Jul 12, 2026 21:5858,45131,284,35620,446,0001,181,0002,113,536
6Jul 12, 2026 21:5858,45431,269,44820,519,0001,109,0002,113,536
7Jul 12, 2026 21:5858,50231,292,15420,518,0001,128,0002,113,536
8Jul 12, 2026 21:5858,51631,328,31820,524,0001,127,0002,113,536
9Jul 12, 2026 21:5858,59131,413,80720,470,0001,209,0002,113,536