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:21olliecrowolliecrowScore: 18,387Success
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:213,54958,183,72826,095,0003,010,0002,461,696
2Mar 10, 2026 22:2118,387175,654,873147,779,0002,995,0002,473,984
3Mar 10, 2026 22:2118,398179,378,946146,871,0003,996,0002,506,752