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:09Ian MckibbenIan MckibbenScore: 969,343Success
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:09968,6047,978,836,7977,818,650,000123,899,0002,392,064
2Jan 9, 2025 09:09969,3437,976,774,8817,820,718,000127,897,0002,297,856
3Jan 9, 2025 09:09969,3447,981,501,2307,844,701,000103,916,0002,281,472