Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listAug 9, 2026 09:14Tomislav TunkovicTomislav TunkovicScore: 4,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2026 09:144,411672,508,699648,846,00012,933,00016,801,792stderr
2Aug 9, 2026 09:144,412671,970,035649,181,00012,730,00016,801,792stderr
3Aug 9, 2026 09:144,414672,100,294649,299,00012,812,00016,801,792stderr
4Aug 9, 2026 09:144,415672,417,442649,486,00012,836,00016,801,792stderr
5Aug 9, 2026 09:144,415672,398,133649,365,00012,983,00016,801,792stderr
6Aug 9, 2026 09:144,415673,099,237649,425,00012,906,00016,801,792stderr
7Aug 9, 2026 09:144,421673,152,505650,245,00012,932,00016,801,792stderr
8Aug 9, 2026 09:144,422673,405,801650,539,00012,887,00016,801,792stderr
9Aug 9, 2026 09:144,423674,373,403650,643,00012,954,00016,801,792stderr