C++ Implementation of bentley ottman algorithm

IMPORTANT:
Please do not make any proposals If you do not have any past experience with the algorithm.
The task is very difficult to perform If you are not familiar with the implementation of the algorithm.
4 Freelancer have failed to implement the algorithm so far.

C++ Implementation of bentley ottman algorithm.
Input:
std::vector<Segment>
struct segment
{
double x1;
double y1;
double x2;
double y2;
}

Output:
Total number of intersecting segments, At time complexity of (n+k)logn, Where n is the number of Segments, And k Is the number of intersections.

The algorithm should be 200-400 Lines of code In total.
The algorithm will be very difficult to implement for those who do not have experience with this algorithm, And should take no more then 1-3 days for those who are familiar with the implementation.
It may sound easy to implement, But the task Is very very challenging.