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:08Ian MckibbenIan MckibbenScore: 970,436Success
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:08966,3837,958,344,1717,795,446,000128,891,0002,281,472
2Jan 9, 2025 09:08970,4367,987,220,0907,854,661,000102,916,0002,281,472
3Jan 9, 2025 09:08976,8938,045,526,5797,891,620,000118,903,0002,478,080