Depends on the structure. 100000 dense SOCP constraints in 1000 variables could be completely unsolvable, while very sparse it could probably be solved in seconds or at least minutes
Here is a 10^5 sized problem solved in 1 second. Trivial beyond sanity of course, but that's the point.
>> N = 100000;
>> x = sdpvar(2,N);
>> optimize(cone([ones(1,N);x]),sum(sum(x)))
yalmipversion: '20200930'
matlabversion: '9.9.0.1524771 (R2020b) Update 2'
yalmiptime: 1.1608
solvertime: 0.9222
info: 'Successfully solved (MOSEK)'
problem: 0