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 listJun 29, 2026 12:37IlyaIlyaScore: 70,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 12:3870,44835,548,10324,968,0001,098,0002,113,536
2Jun 29, 2026 12:3870,45435,554,63924,975,0001,093,0002,113,536
3Jun 29, 2026 12:3870,65935,568,94625,048,0001,096,0002,113,536
4Jun 29, 2026 12:3870,82135,690,75225,113,0001,091,0002,113,536
5Jun 29, 2026 12:3870,89436,147,85225,019,0001,212,0002,113,536
6Jun 29, 2026 12:3870,98935,696,62125,151,0001,115,0002,113,536
7Jun 29, 2026 12:3871,06236,147,52325,106,0001,187,0002,113,536
8Jun 29, 2026 12:3871,14036,263,91725,112,0001,210,0002,113,536
9Jun 29, 2026 12:3871,33236,323,77025,150,0001,243,0002,113,536