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 3, 2026 23:28olliecrowolliecrowScore: 24,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:2824,624230,949,576200,915,000999,0002,379,776
2Mar 3, 2026 23:2824,625222,593,889199,928,0001,999,0002,371,584
3Mar 3, 2026 23:2824,659231,545,914201,201,0001,001,0002,379,776