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 listOct 21, 2026 14:34e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 14:3504,613,193,8311,719,485,000853,914,0002,150,400expected "2197661494 ", got "2197661473 "
2Oct 21, 2026 14:3509,361,916,5312,116,740,0001,709,842,0002,117,632expected "2135140651 ", got "2135140619 "
3Oct 21, 2026 14:35011,266,562,6842,175,750,0002,205,233,0002,113,536expected "2199404629 ", got "2199404586 "