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 26, 2026 21:45Dominique GarmierDominique GarmierScore: 72,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 21:4571,73551,090,21825,522,0001,020,0002,502,656
2Mar 26, 2026 21:4572,54955,816,21924,855,0001,988,0002,359,296
3Mar 26, 2026 21:4572,97851,899,68425,002,0002,000,0002,502,656