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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 11:5421,562200,566,435174,811,0001,997,0002,396,160
2Jul 6, 2025 11:5421,594200,187,355176,074,0001,000,0002,392,064
3Jul 6, 2025 11:5421,695204,668,944175,901,0001,998,0002,269,184