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 6, 2026 11:04Victor MerckléVictor MerckléScore: 64,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 11:0564,05432,763,08922,649,0001,051,0002,113,536
2Jun 6, 2026 11:0564,06732,793,66522,656,0001,049,0002,113,536
3Jun 6, 2026 11:0564,15432,820,01922,607,0001,130,0002,113,536
4Jun 6, 2026 11:0564,17535,206,30422,614,0001,131,0002,113,536
5Jun 6, 2026 11:0564,20232,805,98622,626,0001,129,0002,113,536
6Jun 6, 2026 11:0564,42132,891,98522,690,0001,146,0002,113,536
7Jun 6, 2026 11:0564,43732,965,30422,786,0001,056,0002,113,536
8Jun 6, 2026 11:0564,69132,986,79122,800,0001,136,0002,113,536
9Jun 6, 2026 11:0564,71033,031,57522,798,0001,145,0002,113,536