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 15:42IlyaIlyaScore: 66,745Success
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 15:4366,16234,491,52223,273,0001,207,0002,113,536
2Jun 30, 2026 15:4366,42134,528,70323,353,0001,223,0002,113,536
3Jun 30, 2026 15:4366,61834,131,02223,478,0001,171,0002,113,536
4Jun 30, 2026 15:4366,64334,111,34523,535,0001,123,0002,113,536
5Jun 30, 2026 15:4366,74534,626,89923,492,0001,204,0002,113,536
6Jun 30, 2026 15:4366,80234,260,20123,585,0001,132,0002,113,536
7Jun 30, 2026 15:4366,85434,253,28123,541,0001,195,0002,113,536
8Jun 30, 2026 15:4366,89135,516,36123,629,0001,121,0002,113,536
9Jun 30, 2026 15:4367,01834,336,74623,667,0001,130,0002,113,536