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 23, 2026 18:22Victor MerckléVictor MerckléScore: 2,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:232,75331,002,04521,490,0001,091,0002,117,632stderr
2Aug 23, 2026 18:232,76030,960,07721,530,0001,104,0002,117,632stderr
3Aug 23, 2026 18:232,77631,134,90021,745,0001,025,0002,117,632stderr
4Aug 23, 2026 18:232,77631,117,13021,746,0001,025,0002,117,632stderr
5Aug 23, 2026 18:232,78731,181,14121,761,0001,094,0002,117,632stderr
6Aug 23, 2026 18:232,79033,091,15021,867,0001,019,0002,117,632stderr
7Aug 23, 2026 18:232,79131,233,48821,741,0001,151,0002,117,632stderr
8Aug 23, 2026 18:235,42652,838,05743,455,0001,043,0002,117,632stderr
9Aug 23, 2026 18:235,46153,163,69043,656,0001,127,0002,117,632stderr