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 listJul 6, 2025 13:30Aniruddha DebAniruddha DebScore: 67,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 13:3067,49545,875,18323,975,000998,0002,424,832
2Jul 6, 2025 13:3067,58946,750,73424,008,0001,000,0002,531,328
3Jul 6, 2025 13:3067,94154,145,67924,133,0001,005,0002,428,928