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 10:20olliecrowolliecrowScore: 62,713Success
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 10:2362,61353,536,41621,153,0002,014,0002,494,464stderr
2Apr 21, 2026 10:2362,65446,553,99021,167,0002,015,0002,486,272stderr
3Apr 21, 2026 10:2362,68148,475,91320,167,0003,025,0002,494,464stderr
4Apr 21, 2026 10:2362,70052,510,05520,173,0003,026,0002,494,464stderr
5Apr 21, 2026 10:2362,71350,771,02422,196,0001,008,0002,256,896stderr
6Apr 21, 2026 10:2362,73551,881,43520,185,0003,027,0002,494,464stderr
7Apr 21, 2026 10:2362,90050,512,41321,250,0002,023,0002,486,272stderr
8Apr 21, 2026 10:2363,04050,297,44220,283,0003,042,0002,486,272stderr
9Apr 21, 2026 10:2363,12746,636,53021,326,0002,031,0002,486,272stderr