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 5, 2026 13:20Victor MerckléVictor MerckléScore: 66,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 13:2166,61033,699,40823,608,0001,038,0002,113,536
2Jun 5, 2026 13:2166,80033,870,45723,585,0001,131,0002,113,536
3Jun 5, 2026 13:2166,81633,865,90823,577,0001,145,0002,113,536
4Jun 5, 2026 13:2166,82133,849,40023,654,0001,070,0002,113,536
5Jun 5, 2026 13:2166,91033,881,17023,624,0001,133,0002,113,536
6Jun 5, 2026 13:2166,99733,931,56323,647,0001,142,0002,113,536
7Jun 5, 2026 13:2167,10833,965,47723,782,0001,048,0002,113,536
8Jun 5, 2026 13:2167,18933,973,84723,784,0001,076,0002,113,536
9Jun 5, 2026 13:2167,34033,978,89223,770,0001,146,0002,113,536