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 12:03IlyaIlyaScore: 61,170Success
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 12:0560,74332,095,07221,352,0001,123,0002,113,536
2Jul 7, 2026 12:0561,00532,285,45621,450,0001,122,0002,113,536
3Jul 7, 2026 12:0561,02732,278,13621,365,0001,215,0002,113,536
4Jul 7, 2026 12:0561,14032,369,11221,598,0001,024,0002,113,536
5Jul 7, 2026 12:0561,17032,816,16221,393,0001,240,0002,113,536
6Jul 7, 2026 12:0561,24032,348,47221,436,0001,223,0002,113,536
7Jul 7, 2026 12:0561,31032,380,17721,489,0001,196,0002,113,536
8Jul 7, 2026 12:0561,38332,620,66021,494,0001,218,0002,113,536
9Jul 7, 2026 12:0561,67532,976,56121,755,0001,065,0002,113,536