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 listApr 25, 2026 18:27olliecrowolliecrowScore: 3,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 18:283,46945,640,87325,403,0003,048,0002,334,720
2Apr 25, 2026 18:283,48847,800,80525,542,0003,065,0002,478,080
3Apr 25, 2026 18:283,48947,153,36425,549,0003,065,0002,572,288
4Apr 25, 2026 18:283,49946,898,00525,621,0003,074,0002,453,504
5Apr 25, 2026 18:283,63250,779,37328,756,0001,027,0002,367,488
6Apr 25, 2026 18:2823,330212,183,025188,309,0003,004,0002,441,216
7Apr 25, 2026 18:2823,368211,138,547187,631,0003,992,0002,326,528
8Apr 25, 2026 18:2823,386209,598,497185,776,0005,992,0002,469,888
9Apr 25, 2026 18:2823,421209,842,502188,057,0004,001,0002,482,176