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 22, 2026 20:04Dominique GarmierDominique GarmierScore: 101,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 20:13100,46567,954,03236,168,0001,004,0002,334,720
2Mar 22, 2026 20:13100,72260,175,40836,260,0001,007,0002,547,712
3Mar 22, 2026 15:55101,03059,395,02434,351,0003,030,0002,334,720
4Mar 22, 2026 19:21101,11461,211,45734,379,0003,033,0002,379,776
5Mar 22, 2026 20:04101,33057,821,87336,479,0001,013,0002,334,720
6Mar 22, 2026 15:55101,40361,189,76237,519,00002,547,712
7Mar 22, 2026 19:21101,41659,375,15836,510,0001,014,0002,334,720
8Mar 22, 2026 19:21101,59563,343,04435,559,0002,031,0002,334,720
9Mar 22, 2026 15:55101,60062,311,59336,576,0001,016,0002,334,720
10Mar 22, 2026 20:13101,78164,110,58936,642,0001,017,0002,334,720
11Mar 22, 2026 20:04102,47663,382,85535,921,0001,995,0002,334,720
12Mar 22, 2026 20:04103,96859,216,50034,419,0004,049,0002,293,760