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 listMar 6, 2026 10:49olliecrowolliecrowScore: 61,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 10:4560,77043,236,14621,463,0001,022,0002,396,160
2Mar 6, 2026 10:4560,80345,621,65721,475,0001,022,0002,392,064
3Mar 6, 2026 10:4960,80345,405,67621,475,0001,022,0002,400,256
4Mar 6, 2026 10:4560,84645,818,15421,490,0001,023,0002,400,256
5Mar 6, 2026 10:4560,87846,353,41821,502,0001,023,0002,392,064
6Mar 6, 2026 10:4560,89746,753,73621,508,0001,024,0002,273,280
7Mar 6, 2026 10:4961,00551,834,50322,572,00002,273,280
8Mar 6, 2026 10:4561,05946,800,08122,592,00002,514,944
9Mar 6, 2026 10:4561,08947,744,97121,576,0001,027,0002,273,280
10Mar 6, 2026 10:4961,18952,202,94521,611,0001,029,0002,273,280
11Mar 6, 2026 10:4561,24648,781,10721,631,0001,030,0002,273,280
12Mar 6, 2026 10:4561,37051,008,12422,707,00002,273,280