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 listDec 12, 2024 18:28Yuriy LyfenkoYuriy LyfenkoScore: 4,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 18:284,13959,670,69830,945,0002,994,0002,342,912
2Dec 12, 2024 18:284,14559,585,48131,990,0001,999,0002,355,200
3Dec 12, 2024 18:284,16853,353,11631,161,0003,015,0002,502,656