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 8, 2026 17:40IlyaIlyaScore: 60,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 8, 2026 17:4359,98931,841,57921,068,0001,128,0002,113,536
2Jul 8, 2026 17:4360,03531,873,44821,012,0001,201,0002,113,536
3Jul 8, 2026 17:4360,15132,511,67721,050,0001,206,0002,113,536
4Jul 8, 2026 17:4360,24332,541,29821,091,0001,199,0002,113,536
5Jul 8, 2026 17:4360,25931,864,25721,179,0001,117,0002,113,536
6Jul 8, 2026 17:4360,29432,615,60621,091,0001,218,0002,113,536
7Jul 8, 2026 17:4360,38132,216,16521,130,0001,211,0002,113,536
8Jul 8, 2026 17:4360,42732,667,49521,136,0001,222,0002,113,536
9Jul 8, 2026 17:4360,46732,308,32921,161,0001,212,0002,113,536