Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listMay 3, 2026 14:06TudyMTudyMScore: 25,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 14:0625,240221,671,485204,800,0002,170,0002,367,488
2May 3, 2026 14:0625,240220,399,162204,798,0002,176,0002,351,104
3May 3, 2026 14:0625,263226,295,271204,935,0002,229,0002,359,296
4May 3, 2026 14:0625,272222,806,059204,997,0002,241,0002,359,296
5May 3, 2026 14:0625,281223,671,103205,157,0002,150,0002,363,392
6May 3, 2026 14:0625,290223,117,516205,215,0002,163,0002,363,392
7May 3, 2026 14:0625,355224,123,746205,724,0002,191,0002,359,296
8May 3, 2026 14:0625,357222,143,230205,732,0002,197,0002,363,392
9May 3, 2026 14:0625,527227,445,471207,127,0002,196,0002,371,584