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 21:33Valentin KofmanValentin KofmanScore: 15,512Success
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 21:3315,394150,715,298125,233,0001,001,0002,486,272
2Jul 6, 2025 21:3315,512157,059,884126,200,0001,001,0002,396,160
3Jul 6, 2025 21:3315,567151,165,550126,652,000997,0002,404,352