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 07: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 9, 2026 07:57061,732,99738,156,0008,847,0002,482,176expected "1940486891 ", got " "
2May 9, 2026 07:575,51060,660,01236,699,0008,483,0002,437,120
3May 9, 2026 07:575,61060,240,01037,300,0008,708,0002,514,944