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 30, 2026 08:59Dominique GarmierDominique GarmierScore: 72,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 08:5972,60054,447,53626,862,00002,289,664
2Mar 30, 2026 08:5972,71153,584,92324,911,0001,992,0002,371,584
3Mar 30, 2026 08:5973,94352,446,83926,346,0001,013,0002,289,664