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 listJul 11, 2025 07:21Valentin KofmanValentin KofmanScore: 6,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2025 07:216,90083,416,52838,396,00018,187,0002,400,256
2Jul 11, 2025 07:216,92181,271,25139,827,00016,926,0002,338,816
3Jul 11, 2025 07:217,22582,191,36440,169,00019,080,0002,293,760