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 listMar 21, 2026 20:19izotoffizotoffScore: 79,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:1978,62457,759,48127,085,0002,006,0002,367,488
2Mar 21, 2026 20:1979,50063,768,88028,401,0001,014,0002,306,048
3Mar 21, 2026 20:1985,89762,791,33328,707,0003,075,0002,355,200