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 2, 2026 13:18Pavel 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 2, 2026 13:180151,594,769127,112,0008,070,0002,326,528expected "2344761501 ", got " "
2May 2, 2026 13:1815,650145,877,204119,307,0009,023,0002,342,912
3May 2, 2026 13:1816,891158,100,377130,484,0008,029,0002,351,104