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 19, 2026 14:28Dominique GarmierDominique GarmierScore: 70,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:2469,87051,935,87423,864,0001,988,0002,273,280
2Mar 15, 2026 22:2469,91951,007,26023,880,0001,990,0002,273,280
3Mar 15, 2026 22:2469,92450,815,08923,882,0001,990,0002,392,064
4Mar 19, 2026 14:2869,94352,799,51224,884,000995,0002,396,160
5Mar 15, 2026 22:2470,01152,904,39724,868,0001,036,0002,396,160
6Mar 15, 2026 22:2470,02455,751,01123,916,0001,993,0002,273,280
7Mar 15, 2026 22:2470,07357,338,84824,930,000997,0002,514,944
8Mar 19, 2026 14:2870,19555,337,76823,975,0001,997,0002,400,256
9Mar 19, 2026 14:2870,37052,730,76025,036,0001,001,0002,519,040
10Mar 15, 2026 22:2470,41153,237,97725,050,0001,002,0002,273,280
11Mar 15, 2026 22:2470,43562,438,50624,057,0002,004,0002,396,160
12Mar 15, 2026 22:2470,52451,625,20325,091,0001,003,0002,273,280