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 17, 2023 22:38Yurkov AlekseyYurkov AlekseyScore: 32,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2023 22:3831,589344,867,591259,031,26002,269,184
2Dec 17, 2023 22:3832,581341,584,367267,165,66302,277,376
3Dec 17, 2023 22:3833,660336,281,730276,014,16302,260,992