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 10:55IlyaIlyaScore: 60,383Success
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 10:5660,25431,745,21521,195,0001,099,0002,113,536
2Jun 30, 2026 10:5660,26731,760,19021,185,0001,114,0002,113,536
3Jun 30, 2026 10:5660,27831,714,47521,219,0001,084,0002,113,536
4Jun 30, 2026 10:5660,32931,770,80121,209,0001,113,0002,113,536
5Jun 30, 2026 10:5660,38331,880,55321,233,0001,109,0002,113,536
6Jun 30, 2026 10:5660,47032,304,49621,182,0001,192,0002,113,536
7Jun 30, 2026 10:5660,48132,314,46921,178,0001,200,0002,113,536
8Jun 30, 2026 10:5660,57231,894,51821,316,0001,096,0002,113,536
9Jun 30, 2026 10:5660,66432,428,59421,231,0001,215,0002,113,536