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 listJan 12, 2026 04:15Josu San MartinJosu San MartinScore: 86,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 04:1585,20858,543,37929,493,0002,034,0002,289,664
2Jan 12, 2026 04:1586,07361,278,57529,857,0001,990,0002,478,080
3Jan 12, 2026 04:1588,10558,460,98931,581,0001,018,0002,510,848