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 20:36IlyaIlyaScore: 59,762Success
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 20:3759,41631,435,68720,886,0001,098,0002,113,536
2Jun 29, 2026 20:3759,47031,510,75520,864,0001,140,0002,113,536
3Jun 29, 2026 20:3759,48631,368,27720,899,0001,111,0002,113,536
4Jun 29, 2026 20:3759,68131,557,51920,905,0001,177,0002,113,536
5Jun 29, 2026 20:3759,76231,681,62520,977,0001,135,0002,113,536
6Jun 29, 2026 20:3759,76231,573,34420,972,0001,140,0002,113,536
7Jun 29, 2026 20:3759,88632,096,55520,925,0001,233,0002,113,536
8Jun 29, 2026 20:3760,01833,300,92120,970,0001,237,0002,113,536
9Jun 29, 2026 20:3760,12131,660,01521,204,0001,041,0002,113,536