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 30, 2026 14:32IlyaIlyaScore: 59,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:3359,19131,325,73220,789,0001,112,0002,113,536
2Jun 30, 2026 14:3359,23231,581,36820,740,0001,176,0002,113,536
3Jun 30, 2026 14:3359,42731,980,80620,767,0001,221,0002,113,536
4Jun 30, 2026 14:3359,44831,495,56520,854,0001,142,0002,113,536
5Jun 30, 2026 14:3359,48631,881,01820,797,0001,213,0002,113,536
6Jun 30, 2026 14:3359,50031,931,57820,813,0001,202,0002,113,536
7Jun 30, 2026 14:3359,58132,009,35220,811,0001,234,0002,113,536
8Jun 30, 2026 14:3359,66231,992,90020,867,0001,208,0002,113,536
9Jun 30, 2026 14:3359,77231,972,97320,884,0001,232,0002,113,536