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 listApr 21, 2026 06:09Charles CabergsCharles CabergsScore: 70,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 06:1070,51653,629,68725,088,0001,003,0002,351,104
2Apr 21, 2026 06:1070,72755,525,20524,156,0002,013,0002,351,104
3Apr 21, 2026 06:1070,73250,633,99924,158,0002,013,0002,347,008
4Apr 21, 2026 06:1070,82155,642,49725,197,0001,007,0002,351,104
5Apr 21, 2026 06:1070,84350,657,32824,196,0002,016,0002,351,104
6Apr 21, 2026 06:1070,87552,681,46224,207,0002,017,0002,359,296
7Apr 21, 2026 06:1070,98351,600,59625,254,0001,010,0002,355,200
8Apr 21, 2026 06:1071,01051,693,44424,253,0002,021,0002,351,104
9Apr 21, 2026 06:1071,01648,629,27224,255,0002,021,0002,355,200