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 10, 2026 13:00olliecrowolliecrowScore: 15,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 13:0015,132149,691,326122,079,0002,001,0002,396,160
2Mar 10, 2026 13:0015,209152,046,894120,721,0003,990,0002,355,200
3Mar 10, 2026 13:0015,211158,790,556124,727,00002,371,584