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 listSep 19, 2026 19:22Andrew EpsteinAndrew EpsteinScore: 23,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:2322,461194,710,797183,179,0001,004,0002,117,632stderr
2Sep 19, 2026 19:2322,908198,233,146186,819,0001,028,0002,117,632stderr
3Sep 19, 2026 19:2322,913198,320,723186,869,0001,025,0002,117,632stderr
4Sep 19, 2026 19:2322,955198,586,898187,231,0001,004,0002,117,632stderr
5Sep 19, 2026 19:2323,002199,007,110187,610,0001,007,0002,117,632stderr
6Sep 19, 2026 19:2323,078199,727,035188,237,0001,005,0002,117,632stderr
7Sep 19, 2026 19:2323,546203,454,385192,057,0001,028,0002,117,632stderr
8Sep 19, 2026 19:2323,548203,626,900192,062,0001,032,0002,117,632stderr
9Sep 19, 2026 19:2324,120208,250,387196,783,0001,004,0002,117,632stderr