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 04:01Steve BronderSteve BronderScore: 63,243Success
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 04:0162,86248,001,73522,248,0001,011,0002,539,520
2Jul 15, 2025 04:0162,93848,154,40722,275,0001,012,0002,539,520
3Jul 15, 2025 04:0162,99744,726,12622,296,0001,013,0002,539,520
4Jul 15, 2025 04:0163,15943,004,41823,369,00002,441,216
5Jul 15, 2025 04:0163,24343,664,96223,400,00002,535,424
6Jul 15, 2025 04:0163,32745,116,40023,431,00002,433,024
7Jul 15, 2025 04:0163,38643,033,66423,453,00002,535,424
8Jul 15, 2025 04:0163,46541,251,46023,482,00002,539,520
9Jul 15, 2025 04:0163,87050,566,67523,632,00002,428,928