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 15, 2026 22:39Dominique GarmierDominique GarmierScore: 70,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:3969,93551,189,26523,886,0001,990,0002,400,256
2Mar 15, 2026 22:3970,13551,057,82924,952,000998,0002,273,280
3Mar 15, 2026 22:3970,44355,045,90025,062,0001,002,0002,392,064