You should be a bit careful with implementations and keep in mind that you can't split a number larger than the prime you've picked. I've seen people go "oh I'll just split an N-byte value into M * N-byte values, splitting each byte separately with the largest prime < 256, surely the loss of a few values per byte won't be of consequence...". It might not be in your case, but you need to be aware of that.
Python - https://github.com/blockstack/secret-sharing
PHP - https://github.com/mathieuk/secretsharer
Node - https://github.com/amper5and/secrets.js
Go - https://github.com/codahale/sss
C - https://github.com/fletcher/c-sss
Ruby - https://github.com/lian/shamir-secret-sharing
Java - https://github.com/timtiemens/secretshare
Rust - https://github.com/sellibitze/secretshare