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 listApr 25, 2026 08:03limanjun99limanjun99Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 08:03053,160,05031,443,0002,028,000245,760No answer to stdout. Died or killed?
2Apr 25, 2026 08:034,04252,270,35831,138,0002,008,0002,318,336
3Apr 25, 2026 08:034,06854,558,28630,331,0003,033,0002,318,336