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 15:20Victor MerckléVictor MerckléScore: 5,420Success
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 15:222,76030,950,88021,540,0001,096,0002,117,632stderr
2Aug 23, 2026 15:222,78131,785,18121,782,0001,024,0002,117,632stderr
3Aug 23, 2026 15:222,79031,028,86421,866,0001,014,0002,117,632stderr
4Aug 23, 2026 15:222,79531,926,35321,908,0001,018,0002,117,632stderr
5Aug 23, 2026 15:225,42052,669,65643,334,0001,111,0002,117,632stderr
6Aug 23, 2026 15:225,42252,760,96143,405,0001,062,0002,117,632stderr
7Aug 23, 2026 15:225,43052,674,66343,459,0001,071,0002,117,632stderr
8Aug 23, 2026 15:225,43452,784,13643,518,0001,041,0002,117,632stderr
9Aug 23, 2026 15:225,44652,975,11143,496,0001,167,0002,117,632stderr