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 listJun 24, 2026 11:08anboto1anboto1Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:09012,371,84003,025,00024,576Exit with code 1: A0=5ead1e7a,4d7425eb,324c1de6,dea0944d,41bd4e22,a97c3f5b,495fbf9b,a0e942d1,4db8f7fa,46baf6b4,0f62a15b,723a5392 B0=b5b15675,84198ee6,22b91e70,0f340579,756e48cb,45c7a7e3,696e0581,4e4f1e44,64a81f12,529ca129,3542a6b7,3fae6df2stderr