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 listApr 21, 2026 00:43Taylor DettlingTaylor DettlingError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 00:43062,672,62134,071,0003,006,0002,338,816expected "2123476695 ", got "0 "
2Apr 21, 2026 00:43056,735,60633,213,0004,025,0002,277,376expected "2039935310 ", got "0 "
3Apr 21, 2026 00:43054,727,92934,292,0003,025,0002,277,376expected "2147065550 ", got "0 "