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 17:40Dominique GarmierDominique GarmierScore: 70,124Success
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 17:4070,10358,754,76024,941,000997,0002,281,472
2Mar 24, 2026 17:4070,12453,086,82224,949,000997,0002,396,160
3Mar 24, 2026 17:4070,41152,771,53325,050,0001,002,0002,396,160