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 listJun 14, 2021 19:33Mikhail ShirokovMikhail ShirokovScore: 1,003,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2021 19:331,002,2038,281,913,6888,218,062,95602,285,568
2Jun 14, 2021 19:331,003,1288,276,743,0148,225,653,59502,289,664
3Jun 14, 2021 19:331,003,5418,296,936,3998,229,035,33002,289,664