I guess that depends on what "trivial" means. Given that it is np-complete any true solver needs to be able to go into exponential time (assuming p != np) which I wouldn't generally consider to be "trivial" unless its a brute force solver.
And using trivial deductions (based on the numbers in the column, row, and square there is only one possibility) is not sufficient to be better than me (and I don't consider myself to be good).
The "classic" boards (9 by 9) are all easily solved by straightforward methods. Maybe "trivial" is a step too for for the 'eliminate' and 'search' functions here, but they aren't a lot of code either:
And using trivial deductions (based on the numbers in the column, row, and square there is only one possibility) is not sufficient to be better than me (and I don't consider myself to be good).