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 8, 2025 22:57Valentin KofmanValentin KofmanScore: 5,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2025 22:575,42364,593,80135,375,0009,096,0002,314,240
2Jul 8, 2025 22:575,60669,360,04032,976,00012,990,0002,523,136
3Jul 8, 2025 22:575,61870,681,89135,049,00011,015,0002,449,408