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 21:09olliecrowolliecrowScore: 62,881Success
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 21:1062,56442,722,32420,130,0003,019,0002,506,752stderr
2Apr 21, 2026 21:1062,58944,292,37420,138,0003,020,0002,514,944stderr
3Apr 21, 2026 21:1062,64541,707,80620,156,0003,023,0002,519,040stderr
4Apr 21, 2026 21:1062,72139,159,21321,189,0002,018,0002,314,240stderr
5Apr 21, 2026 21:1062,88143,549,01121,243,0002,023,0002,519,040stderr
6Apr 21, 2026 21:1062,90241,662,04420,239,0003,035,0002,502,656stderr
7Apr 21, 2026 21:1063,00245,728,11320,271,0003,040,0002,506,752stderr
8Apr 21, 2026 21:1063,03744,307,10120,282,0003,042,0002,338,816stderr
9Apr 21, 2026 21:1064,89139,620,45021,923,0002,087,0002,494,464stderr