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 21:24IlyaIlyaScore: 61,872Success
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 21:2761,55432,237,97621,681,0001,094,0002,113,536
2Jun 30, 2026 21:2761,79132,310,27321,755,0001,108,0002,113,536
3Jun 30, 2026 21:2761,82932,324,57121,766,0001,111,0002,113,536
4Jun 30, 2026 21:2761,87032,339,31221,807,0001,085,0002,113,536
5Jun 30, 2026 21:2761,87232,395,11921,701,0001,192,0002,113,536
6Jun 30, 2026 21:2762,00532,874,84221,748,0001,194,0002,113,536
7Jun 30, 2026 21:2762,11832,524,18721,791,0001,193,0002,113,536
8Jun 30, 2026 21:2762,20232,939,67121,811,0001,204,0002,113,536
9Jun 30, 2026 21:2762,27532,760,49921,831,0001,211,0002,113,536