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 listMay 5, 2026 01:06olliecrowolliecrowScore: 63,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 01:0763,41838,633,19622,226,0001,239,0002,519,040
2May 5, 2026 01:0763,45142,316,88622,211,0001,266,0002,527,232
3May 5, 2026 01:0763,50040,962,96522,224,0001,271,0002,519,040
4May 5, 2026 01:0763,57538,396,70422,243,0001,280,0002,527,232
5May 5, 2026 01:0763,69443,554,97022,502,0001,065,0002,519,040
6May 5, 2026 01:0763,72438,452,86522,309,0001,269,0002,523,136
7May 5, 2026 01:0763,76241,298,91522,530,0001,062,0002,523,136
8May 5, 2026 01:0763,86740,379,77822,567,0001,064,0002,523,136
9May 5, 2026 01:0763,87041,927,68822,564,0001,068,0002,514,944