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 listJul 7, 2026 13:47IlyaIlyaScore: 60,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 13:5159,90831,756,51721,053,0001,113,0002,113,536
2Jul 7, 2026 13:5159,98931,699,85621,072,0001,124,0002,113,536
3Jul 7, 2026 13:5159,99431,846,66921,062,0001,136,0002,113,536
4Jul 7, 2026 13:5160,17831,929,79221,108,0001,158,0002,113,536
5Jul 7, 2026 13:5160,32932,939,76821,192,0001,130,0002,113,536
6Jul 7, 2026 13:5160,38632,537,46121,141,0001,202,0002,113,536
7Jul 7, 2026 13:5160,39432,543,80021,146,0001,200,0002,113,536
8Jul 7, 2026 13:5160,55632,606,54121,373,0001,033,0002,113,536
9Jul 7, 2026 13:5160,83532,156,54721,479,0001,030,0002,113,536