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 9, 2025 09:06Ian MckibbenIan MckibbenScore: 971,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 09:06971,0197,993,821,7287,847,450,000114,904,0002,478,080
2Jan 9, 2025 09:06971,4547,998,594,6217,852,009,000113,913,0002,400,256
3Jan 9, 2025 09:06973,3728,023,334,2717,866,741,000114,908,0002,310,144