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 08:52Valentin KofmanValentin KofmanScore: 7,106Success
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 08:526,66083,511,91138,428,00016,180,0002,306,048
2Jul 11, 2025 08:527,10679,667,31742,194,00016,074,0002,383,872
3Jul 11, 2025 08:527,16786,463,49736,853,00021,913,0002,478,080