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 15:51Dominique GarmierDominique GarmierScore: 97,449Success
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 15:5197,25760,568,14133,986,0001,999,0002,363,392
2Mar 21, 2026 15:5197,44964,415,52734,053,0002,003,0002,359,296
3Mar 21, 2026 15:5198,50558,484,22835,435,0001,012,0002,289,664