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 24, 2026 09:04Dominique GarmierDominique GarmierScore: 494,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 09:04493,286209,778,870181,514,0001,002,0002,408,448
2Mar 24, 2026 09:04494,654207,477,725179,022,0004,000,0002,400,256
3Mar 24, 2026 09:04495,103204,268,865180,185,0003,003,0002,498,560