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 listMar 17, 2026 14:13limanjun99limanjun99Score: 121,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:13107,091903,072,362751,268,000126,876,0002,281,472
2Mar 17, 2026 14:13121,2711,025,451,199869,498,000124,927,0002,297,856
3Mar 17, 2026 14:13122,0141,025,637,799868,579,000131,936,0002,457,600