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 15, 2025 02:07Steve BronderSteve BronderScore: 69,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 02:0769,21950,893,39024,587,0001,024,0002,433,024
2Jul 15, 2025 02:0769,25953,594,39624,601,0001,025,0002,539,520
3Jul 15, 2025 02:0769,47650,011,88924,678,0001,028,0002,428,928