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 22, 2025 20:48Steve BronderSteve BronderError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 20:4800000Error: expected "429496456595 ", got "429496456595c: 429496486582 m: d: 29987 "stderr
2Apr 22, 2025 20:4868,94945,136,93024,491,0001,020,0002,428,928
3Apr 22, 2025 20:4868,98659,407,00725,525,00002,437,120
4Apr 22, 2025 20:4869,50051,841,14124,726,000989,0002,539,520