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 10:23Dominique GarmierDominique GarmierScore: 3,506,824Success
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 10:233,482,0971,314,657,6931,287,377,000999,0002,375,680
2Mar 30, 2026 10:233,506,8241,327,139,5131,295,526,0001,999,0002,289,664
3Mar 30, 2026 10:233,567,8051,346,926,8911,318,090,0001,998,0002,289,664