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 listSep 19, 2026 17:35Andrew EpsteinAndrew EpsteinScore: 32,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 17:3615,443137,393,109125,622,0001,016,0002,117,632stderr
2Sep 19, 2026 17:3615,486138,196,946125,981,0001,009,0002,117,632stderr
3Sep 19, 2026 17:3615,504137,514,267126,123,0001,013,0002,117,632stderr
4Sep 19, 2026 17:3615,531137,836,046125,314,0002,048,0002,117,632stderr
5Sep 19, 2026 17:3632,750279,012,403267,545,0001,006,0002,117,632stderr
6Sep 19, 2026 17:3633,176283,243,299271,048,0001,003,0002,117,632stderr
7Sep 19, 2026 17:3633,248283,759,625271,636,0001,004,0002,117,632stderr
8Sep 19, 2026 17:3633,303284,211,501272,080,0001,005,0002,117,632stderr
9Sep 19, 2026 17:3633,405284,365,795272,919,0001,004,0002,117,632stderr