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 listJun 26, 2026 08:01Zhou180Zhou180Score: 21,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:023,51137,907,50027,745,0001,046,0002,117,632
2Jun 26, 2026 08:023,55238,274,62628,067,0001,061,0002,117,632
3Jun 26, 2026 08:023,76244,338,38027,752,0003,104,0002,121,728
4Jun 26, 2026 08:0221,686187,088,120175,816,0002,011,0002,121,728
5Jun 26, 2026 08:0221,752187,941,819176,358,0002,011,0002,117,632
6Jun 26, 2026 08:0221,779187,744,408176,585,0002,010,0002,121,728
7Jun 26, 2026 08:0222,044189,953,633178,753,0002,011,0002,117,632
8Jun 26, 2026 08:0222,044189,896,348178,754,0002,012,0002,117,632
9Jun 26, 2026 08:0222,759195,825,999184,614,0002,010,0002,117,632