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 listSep 1, 2026 13:16Victor MerckléVictor MerckléScore: 5,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 13:172,62529,940,67520,507,0001,026,0002,117,632stderr
2Sep 1, 2026 13:172,63630,674,51120,585,0001,032,0002,117,632stderr
3Sep 1, 2026 13:172,63730,728,93920,614,0001,014,0002,117,632stderr
4Sep 1, 2026 13:172,63930,035,90920,611,0001,029,0002,117,632stderr
5Sep 1, 2026 13:175,30951,916,59842,457,0001,080,0002,117,632stderr
6Sep 1, 2026 13:175,32052,065,91142,618,0001,014,0002,117,632stderr
7Sep 1, 2026 13:175,33352,126,30542,628,0001,110,0002,117,632stderr
8Sep 1, 2026 13:175,33452,851,58842,709,0001,033,0002,117,632stderr
9Sep 1, 2026 13:175,34252,795,37742,698,0001,111,0002,117,632stderr