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 17, 2026 04:45marko1597marko1597Score: 2,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:592,529389,523,184374,262,0005,236,00016,801,792stderr
2Aug 17, 2026 04:592,531390,296,252374,550,0005,229,00016,801,792stderr
3Aug 17, 2026 04:592,532389,762,657374,600,0005,227,00016,801,792stderr
4Aug 17, 2026 04:592,533389,996,605374,812,0005,235,00016,801,792stderr
5Aug 17, 2026 04:592,536390,964,510375,107,0005,352,00016,801,792stderr
6Aug 17, 2026 04:592,537390,517,677375,293,0005,266,00016,801,792stderr
7Aug 17, 2026 04:592,538390,828,472375,462,0005,384,00016,801,792stderr
8Aug 17, 2026 04:592,540392,497,552375,865,0005,249,00016,801,792stderr
9Aug 17, 2026 04:592,540391,812,387375,776,0005,276,00016,801,792stderr