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 1, 2026 21:01C21C21Score: 4,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 21:034,27745,654,24732,966,0002,113,0002,117,632stderr
2Oct 1, 2026 21:034,27845,700,95732,940,0002,140,0002,117,632stderr
3Oct 1, 2026 21:034,28345,720,51932,894,0002,230,0002,117,632stderr
4Oct 1, 2026 21:034,29545,815,86832,978,0002,249,0002,117,632stderr
5Oct 1, 2026 21:034,30546,498,42933,042,0002,266,0002,117,632stderr
6Oct 1, 2026 21:034,31746,036,18133,168,0002,239,0002,117,632stderr
7Oct 1, 2026 21:034,31946,021,16133,163,0002,259,0002,117,632stderr
8Oct 1, 2026 21:034,33546,978,60433,292,0002,259,0002,117,632stderr
9Oct 1, 2026 21:034,34146,271,43933,510,0002,090,0002,117,632stderr