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 23, 2026 05:47Dominique GarmierDominique GarmierScore: 70,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 06:4669,90052,806,24323,874,0001,989,0002,281,472
2Mar 22, 2026 21:5969,95751,223,77224,889,000995,0002,490,368
3Mar 22, 2026 21:2570,03851,372,17523,921,0001,993,0002,396,160
4Mar 22, 2026 21:5970,14355,400,29123,957,0001,996,0002,281,472
5Mar 23, 2026 06:4670,15458,245,72624,959,000998,0002,281,472
6Mar 23, 2026 05:4770,18152,414,06323,970,0001,997,0002,281,472
7Mar 22, 2026 21:2570,21444,139,39723,981,0001,998,0002,281,472
8Mar 23, 2026 05:4770,27051,803,54025,000,0001,000,0002,404,352
9Mar 23, 2026 05:4770,35952,151,87525,032,0001,001,0002,281,472
10Mar 22, 2026 21:2570,39757,964,78224,044,0002,003,0002,281,472
11Mar 22, 2026 21:5970,45956,215,11224,065,0002,005,0002,281,472
12Mar 23, 2026 06:4670,78655,217,12325,184,0001,007,0002,281,472