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 14:26IlyaIlyaScore: 60,237Success
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:2859,91632,110,35820,952,0001,217,0002,113,536
2Jun 29, 2026 14:2859,94031,704,35520,954,0001,224,0002,113,536
3Jun 29, 2026 14:2859,96431,639,94621,010,0001,177,0002,113,536
4Jun 29, 2026 14:2860,06432,065,17921,024,0001,200,0002,113,536
5Jun 29, 2026 14:2860,23732,327,96921,073,0001,215,0002,113,536
6Jun 29, 2026 14:2860,29132,212,38621,093,0001,215,0002,113,536
7Jun 29, 2026 14:2860,37031,765,64621,125,0001,212,0002,113,536
8Jun 29, 2026 14:2860,41634,285,76921,264,0001,090,0002,113,536
9Jun 29, 2026 14:2860,96733,972,24521,528,0001,030,0002,113,536