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:24e1011e1011Score: 95,164Success
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:2594,37845,820,96933,792,0001,128,0002,113,536
2Oct 20, 2026 08:2594,81645,936,60033,978,0001,104,0002,113,536
3Oct 20, 2026 08:2594,82946,051,15933,870,0001,217,0002,113,536
4Oct 20, 2026 08:2594,90246,082,88233,909,0001,205,0002,113,536
5Oct 20, 2026 08:2595,16446,587,58934,029,0001,182,0002,113,536
6Oct 20, 2026 08:2595,29146,679,99234,078,0001,180,0002,113,536
7Oct 20, 2026 08:2595,55446,241,22934,232,0001,123,0002,113,536
8Oct 20, 2026 08:2595,59446,215,88134,250,0001,120,0002,113,536
9Oct 20, 2026 08:2596,22947,056,52234,588,0001,017,0002,113,536