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 24, 2026 06:59Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 06:590904,813,089806,525,00087,799,00020,480Exit with code 3: med=2283710362 blocks: -13 29 32 33 -500 33 31 32 54 500 28 31 32 32 -283 32 32 32 32 32 -69 31 -256 15 33 18 32 -238 32 -474 32 109 31 32 32 32 32 32 33 373 32 34 78 32 -49 55 32 25 31 -485 -1 32 32 -89 31 -4 -151 33 31 9 31 33 25 29...stderr