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 10:07Victor MerckléVictor MerckléScore: 64,508Success
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 10:0864,25132,822,61622,640,0001,133,0002,113,536
2Jun 6, 2026 10:0864,39133,008,06422,689,0001,136,0002,113,536
3Jun 6, 2026 10:0864,40532,879,91822,668,0001,162,0002,113,536
4Jun 6, 2026 10:0864,48932,936,37022,718,0001,143,0002,113,536
5Jun 6, 2026 10:0864,50833,009,96522,720,0001,148,0002,113,536
6Jun 6, 2026 10:0864,50833,065,49122,765,0001,103,0002,113,536
7Jun 6, 2026 10:0864,57832,980,87622,842,0001,052,0002,113,536
8Jun 6, 2026 10:0864,89433,135,63222,862,0001,149,0002,113,536
9Jun 6, 2026 10:0865,25633,367,64923,106,0001,039,0002,113,536