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 10, 2026 08:57Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 08:57049,745,55729,725,0003,168,000405,504No answer to stdout. Died or killed?
2May 10, 2026 08:574,30851,311,41731,222,0004,108,0002,428,928
3May 10, 2026 08:574,31048,955,16531,277,0004,067,0002,355,200