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 listOct 20, 2026 08:02e1011e1011Score: 93,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 08:0492,38345,093,07533,080,0001,102,0002,113,536
2Oct 20, 2026 08:0492,46445,051,19533,121,0001,091,0002,113,536
3Oct 20, 2026 08:0492,72945,706,53333,112,0001,198,0002,113,536
4Oct 20, 2026 08:0492,84346,090,70033,170,0001,182,0002,113,536
5Oct 20, 2026 08:0493,15145,365,27133,411,0001,055,0002,113,536
6Oct 20, 2026 08:0493,18345,895,47833,282,0001,196,0002,113,536
7Oct 20, 2026 08:0493,35946,085,94233,318,0001,225,0002,113,536
8Oct 20, 2026 08:0493,51645,958,13833,354,0001,247,0002,113,536
9Oct 20, 2026 08:0494,64845,874,95333,718,0001,302,0002,113,536