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 listJun 8, 2026 01:10Victor MerckléVictor MerckléScore: 64,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:1163,86432,674,80922,568,0001,062,0002,113,536
2Jun 8, 2026 01:1163,94332,686,37622,529,0001,130,0002,113,536
3Jun 8, 2026 01:1163,97032,789,92122,536,0001,133,0002,113,536
4Jun 8, 2026 01:1164,01332,815,52322,612,0001,073,0002,113,536
5Jun 8, 2026 01:1164,03732,806,85322,542,0001,152,0002,113,536
6Jun 8, 2026 01:1164,11332,804,23522,582,0001,140,0002,113,536
7Jun 8, 2026 01:1164,46433,082,89922,707,0001,145,0002,113,536
8Jun 8, 2026 01:1164,49432,988,85422,721,0001,142,0002,113,536
9Jun 8, 2026 01:1164,50232,966,38222,724,0001,142,0002,113,536