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 29, 2026 09:10Victor MerckléVictor MerckléScore: 2,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 09:142,87031,898,23522,497,0001,037,0002,117,632stderr
2Aug 29, 2026 09:142,89032,070,42022,656,0001,049,0002,117,632stderr
3Aug 29, 2026 09:142,89132,016,63222,667,0001,044,0002,117,632stderr
4Aug 29, 2026 09:142,89332,127,98722,686,0001,044,0002,117,632stderr
5Aug 29, 2026 09:142,90639,561,07022,778,0001,058,0002,117,632stderr
6Aug 29, 2026 09:142,90932,262,26622,808,0001,051,0002,117,632stderr
7Aug 29, 2026 09:142,91532,289,46422,844,0001,066,0002,117,632stderr
8Aug 29, 2026 09:145,56954,649,61643,386,0002,286,0002,117,632stderr
9Aug 29, 2026 09:145,66562,476,95044,440,0002,014,0002,117,632stderr