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 listNov 4, 2026 04:09e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 04:090931,815,284780,525,000139,825,0002,113,536expected "2247637190 ", got "1269300176 "
2Nov 4, 2026 04:0901,004,784,961853,944,000139,387,0002,113,536expected "2328876005 ", got "2543618511 "
3Nov 4, 2026 04:0901,101,726,543949,627,000141,022,0002,113,536expected "2102328289 ", got "2071126848 "