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 29, 2026 08:21C21C21Score: 3,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 08:233,62740,244,47527,615,0002,132,0002,113,536
2Sep 29, 2026 08:233,62840,528,43327,627,0002,130,0002,113,536
3Sep 29, 2026 08:233,63140,540,26427,639,0002,140,0002,113,536
4Sep 29, 2026 08:233,63340,675,00927,717,0002,074,0002,113,536
5Sep 29, 2026 08:233,64540,412,11227,670,0002,224,0002,113,536
6Sep 29, 2026 08:233,64540,329,26527,763,0002,127,0002,113,536
7Sep 29, 2026 08:233,66340,545,51727,924,0002,117,0002,113,536
8Sep 29, 2026 08:233,66940,543,08328,016,0002,073,0002,113,536
9Sep 29, 2026 08:233,67240,595,12828,048,0002,064,0002,113,536