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 18, 2026 23:35Dominique GarmierDominique GarmierScore: 70,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 23:3570,08652,363,44523,938,0001,994,0002,400,256
2Mar 18, 2026 23:3570,43552,751,50224,057,0002,004,0002,273,280
3Mar 18, 2026 23:3570,63252,260,59025,129,0001,005,0002,478,080