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 13, 2026 14:41Dominique GarmierDominique GarmierScore: 999,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:41972,289384,736,846357,749,0001,998,0002,379,776
2Mar 13, 2026 14:41999,308400,719,536367,746,0001,998,0002,269,184
3Mar 13, 2026 14:411,001,070401,578,811369,395,0001,001,0002,301,952