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 14:19IlyaIlyaScore: 60,759Success
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 14:2060,44032,009,56421,176,0001,187,0002,113,536
2Jun 29, 2026 14:2060,44031,883,86821,166,0001,197,0002,113,536
3Jun 29, 2026 14:2060,49432,336,11321,182,0001,201,0002,113,536
4Jun 29, 2026 14:2060,51632,325,24921,198,0001,193,0002,113,536
5Jun 29, 2026 14:2060,75932,465,70621,230,0001,251,0002,113,536
6Jun 29, 2026 14:2060,82732,459,89021,274,0001,232,0002,113,536
7Jun 29, 2026 14:2060,85932,406,76521,257,0001,261,0002,113,536
8Jun 29, 2026 14:2060,87232,441,58421,299,0001,224,0002,113,536
9Jun 29, 2026 14:2060,88132,393,29621,460,0001,066,0002,113,536