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 19, 2024 15:19eldon-chungeldon-chungScore: 966,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 15:19961,8987,919,887,0197,700,716,000186,847,0002,277,376
2Dec 19, 2024 15:19966,2397,952,933,3177,734,326,000188,837,0002,277,376
3Dec 19, 2024 15:19970,3617,990,711,0487,770,130,000186,834,0002,277,376