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 09:06Zhou180Zhou180Score: 21,853Success
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 09:073,47639,178,17127,479,0001,031,0002,117,632
2Jun 26, 2026 09:073,48137,676,75527,505,0001,042,0002,117,632
3Jun 26, 2026 09:073,49537,770,13827,608,0001,059,0002,117,632
4Jun 26, 2026 09:073,49537,773,13327,626,0001,041,0002,117,632
5Jun 26, 2026 09:0721,853188,307,329177,181,0002,014,0002,117,632
6Jun 26, 2026 09:0722,152190,764,011179,642,0002,011,0002,117,632
7Jun 26, 2026 09:0722,291191,928,790180,780,0002,012,0002,117,632
8Jun 26, 2026 09:0722,401192,869,596181,681,0002,010,0002,117,632
9Jun 26, 2026 09:0722,784196,030,635183,800,0003,030,0002,117,632