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 17:56Victor MerckléVictor MerckléScore: 2,886Success
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 17:582,84731,664,04422,139,0001,209,0002,117,632stderr
2Aug 23, 2026 17:582,85031,669,77622,349,0001,025,0002,117,632stderr
3Aug 23, 2026 17:582,85731,730,66422,406,0001,028,0002,117,632stderr
4Aug 23, 2026 17:582,87131,886,20422,516,0001,027,0002,117,632stderr
5Aug 23, 2026 17:582,88632,063,28122,395,0001,278,0002,117,632stderr
6Aug 23, 2026 17:582,88732,669,26422,648,0001,027,0002,117,632stderr
7Aug 23, 2026 17:582,90932,192,29222,820,0001,034,0002,117,632stderr
8Aug 23, 2026 17:583,13134,163,80624,614,0001,062,0002,117,632stderr
9Aug 23, 2026 17:585,49053,336,25544,004,0001,017,0002,117,632stderr