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 13:59IlyaIlyaScore: 64,454Success
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 14:0064,12133,354,61322,524,0001,201,0002,113,536
2Jun 29, 2026 14:0064,27033,664,56422,564,0001,216,0002,113,536
3Jun 29, 2026 14:0064,32133,337,81122,693,0001,106,0002,113,536
4Jun 29, 2026 14:0064,37233,341,00922,569,0001,249,0002,113,536
5Jun 29, 2026 14:0064,45433,744,96422,625,0001,223,0002,113,536
6Jun 29, 2026 14:0064,48133,456,13122,826,0001,032,0002,113,536
7Jun 29, 2026 14:0064,56433,907,07222,651,0001,238,0002,113,536
8Jun 29, 2026 14:0064,69733,930,23022,711,0001,227,0002,113,536
9Jun 29, 2026 14:0065,14533,708,23922,891,0001,213,0002,113,536