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 27, 2022 15:06Vlad ShcherbinaVlad ShcherbinaScore: 40,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 15:0640,015390,125,272328,124,32702,314,240
2Nov 27, 2022 15:0640,063401,189,638328,519,10902,322,432
3Nov 27, 2022 15:0640,214388,155,073329,757,70902,322,432