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 21, 2026 14:58izotoffizotoffScore: 126,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 14:58126,84673,431,77444,936,0001,997,0002,486,272
2Mar 21, 2026 14:58126,84974,662,36445,936,000998,0002,482,176
3Mar 21, 2026 14:58127,70371,765,30444,234,0003,016,0002,551,808