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 22:52olliecrowolliecrowScore: 9,269Success
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 22:524,03662,887,95431,088,0002,005,0002,433,024
2Mar 10, 2026 22:529,269102,212,32571,006,0005,000,0002,342,912
3Mar 10, 2026 22:529,341105,385,69072,567,0004,031,0002,314,240