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 24, 2026 06:29Dominique GarmierDominique GarmierScore: 71,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 06:2971,13547,728,98325,308,0001,012,0002,363,392
2Mar 24, 2026 06:2971,42450,940,77626,427,00002,367,488
3Mar 24, 2026 06:2972,16852,930,07626,702,00002,371,584