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 listNov 20, 2024 16:27Joad NacerJoad NacerScore: 8,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 16:306,91788,907,43147,767,0008,956,0002,535,424
2Nov 20, 2024 16:277,83085,741,44357,184,0007,022,0002,400,256
3Nov 20, 2024 16:308,02793,284,56759,836,0005,983,0002,400,256
4Nov 20, 2024 16:308,08890,134,17058,280,0008,038,0002,433,024
5Nov 20, 2024 16:278,16092,140,54459,924,0006,991,0002,412,544
6Nov 20, 2024 16:278,27093,508,35261,832,0005,983,0002,408,448