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 listMay 7, 2025 08:59KeefeKeefeScore: 11,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2025 08:5911,013111,727,59989,301,0001,003,0002,469,888
2May 7, 2025 08:5911,014112,981,22589,315,0001,003,0002,428,928
3May 7, 2025 08:5911,039118,744,27989,515,0001,005,0002,445,312