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 14:22Victor MerckléVictor MerckléScore: 2,871Success
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 14:272,81632,739,54521,967,0001,126,0002,117,632stderr
2Aug 19, 2026 14:272,84931,614,93722,244,0001,121,0002,117,632stderr
3Aug 19, 2026 14:272,85832,536,10022,412,0001,026,0002,117,632stderr
4Aug 19, 2026 14:272,85931,594,56422,418,0001,026,0002,117,632stderr
5Aug 19, 2026 14:272,87132,567,03922,525,0001,023,0002,117,632stderr
6Aug 19, 2026 14:272,92932,278,00423,007,0001,012,0002,117,632stderr
7Aug 19, 2026 14:272,93232,385,05523,001,0001,046,0002,117,632stderr
8Aug 19, 2026 14:275,58053,982,64644,621,0001,140,0002,117,632stderr
9Aug 19, 2026 14:275,58753,978,68344,687,0001,128,0002,117,632stderr