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 listAug 4, 2021 13:15Mikhail ShirokovMikhail ShirokovScore: 21,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2021 13:1521,656235,665,558177,579,05602,191,360
2Aug 4, 2021 13:1521,686247,023,455177,825,50102,183,168
3Aug 4, 2021 13:1521,738231,798,899178,255,46002,256,896