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 9, 2026 08:08Pavel 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 9, 2026 08:09063,193,36538,216,0008,681,0002,314,240expected "2314558297 ", got " "
2May 9, 2026 08:09062,564,41438,421,0008,928,0002,494,464expected "2291165756 ", got " "
3May 9, 2026 08:096,15667,479,65840,187,00010,296,0002,306,048