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 9, 2026 18:04janwwwjanwwwScore: 63,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 18:0762,72938,251,28922,162,0001,048,0002,113,536
2Oct 9, 2026 18:0762,72933,652,85322,174,0001,036,0002,113,536
3Oct 9, 2026 18:0762,81033,624,21122,170,0001,070,0002,113,536
4Oct 9, 2026 18:0762,97233,687,87322,256,0001,044,0002,113,536
5Oct 9, 2026 18:0763,08633,679,92222,327,0001,015,0002,113,536
6Oct 9, 2026 18:0763,11633,683,59722,310,0001,043,0002,113,536
7Oct 9, 2026 18:0763,13533,755,87222,326,0001,034,0002,113,536
8Oct 9, 2026 18:0763,26733,696,27822,362,0001,047,0002,113,536
9Oct 9, 2026 18:0763,29433,792,13422,371,0001,048,0002,113,536