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 20:57olliecrowolliecrowScore: 15,781Success
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 20:5710,587113,181,02684,821,0001,995,0002,379,776
2Mar 10, 2026 20:5715,781150,595,754126,394,0003,009,0002,494,464
3Mar 10, 2026 20:5715,896155,854,616127,343,0003,008,0002,420,736