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 listApr 20, 2026 13:10Dominique GarmierDominique GarmierScore: 70,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 13:1170,22751,617,30023,986,0001,998,0002,367,488
2Apr 20, 2026 13:1170,29452,317,53725,009,0001,000,0002,371,584
3Apr 20, 2026 13:1170,45652,648,24025,067,0001,002,0002,375,680