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 listAug 19, 2026 15:38Victor MerckléVictor MerckléScore: 2,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:402,88131,820,77322,599,0001,032,0002,117,632stderr
2Aug 19, 2026 15:402,88531,979,39922,484,0001,174,0002,117,632stderr
3Aug 19, 2026 15:402,89232,045,88922,624,0001,094,0002,117,632stderr
4Aug 19, 2026 15:402,89532,760,89722,720,0001,024,0002,117,632stderr
5Aug 19, 2026 15:402,90732,123,98922,816,0001,027,0002,117,632stderr
6Aug 19, 2026 15:405,48253,231,10743,928,0001,028,0002,117,632stderr
7Aug 19, 2026 15:405,50853,461,49544,077,0001,093,0002,117,632stderr
8Aug 19, 2026 15:405,51453,906,90544,169,0001,046,0002,117,632stderr
9Aug 19, 2026 15:405,82056,013,84146,702,0001,028,0002,117,632stderr