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 listNov 1, 2021 10:02Jules MinierJules MinierScore: 98,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2021 10:0298,199860,082,350805,230,53302,265,088
2Nov 1, 2021 10:0298,445867,190,658807,245,73202,260,992
3Nov 1, 2021 10:0298,955873,578,528811,435,03702,265,088