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 19, 2026 00:29Dominique GarmierDominique GarmierScore: 69,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 00:2969,89548,311,83123,872,0001,989,0002,396,160
2Mar 19, 2026 00:2969,96551,945,05724,852,0001,035,0002,506,752
3Mar 19, 2026 00:2970,10552,299,33723,944,0001,995,0002,400,256