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 07:07IlyaIlyaScore: 67,259Success
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 07:0965,70233,801,60023,180,0001,130,0002,113,536
2Jul 3, 2026 07:0966,35434,552,37223,435,0001,116,0002,113,536
3Jul 3, 2026 07:0966,50234,141,69323,487,0001,119,0002,113,536
4Jul 3, 2026 07:0966,67534,686,03723,548,0001,122,0002,113,536
5Jul 3, 2026 07:0967,25936,183,50123,654,0001,232,0002,113,536
6Jul 3, 2026 07:0967,32934,942,95623,740,0001,172,0002,113,536
7Jul 3, 2026 07:0967,40234,537,16923,835,0001,104,0002,113,536
8Jul 3, 2026 07:0967,82735,122,82824,037,0001,059,0002,113,536
9Jul 3, 2026 07:0969,15135,594,00824,383,0001,203,0002,113,536