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 30, 2026 15:49Dominique GarmierDominique GarmierScore: 70,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 15:4970,54147,654,23924,093,0002,007,0002,355,200
2Mar 30, 2026 15:4970,95745,414,79924,235,0002,019,0002,359,296
3Mar 30, 2026 15:4971,10551,536,17224,286,0002,023,0002,289,664