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 22, 2026 17:03Dominique GarmierDominique GarmierScore: 99,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 17:0395,80357,855,87234,435,0001,012,0002,363,392
2Mar 22, 2026 17:0399,58160,040,47334,854,0001,991,0002,355,200
3Mar 22, 2026 17:0399,68958,166,98534,892,0001,993,0002,367,488