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 listJan 15, 2025 23:56Ian MckibbenIan MckibbenScore: 12,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2025 23:5612,196122,240,91999,011,0001,000,0002,453,504
2Jan 15, 2025 23:5612,204122,741,76898,073,0002,001,0002,420,736
3Jan 15, 2025 23:5612,260128,625,51899,528,0001,005,0002,510,848