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 listJul 1, 2026 05:28Victor MerckléVictor MerckléScore: 1,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 05:291,653257,319,399240,066,0007,896,00016,801,792stderr
2Jul 1, 2026 05:291,654257,507,764240,143,0008,011,00016,801,792stderr
3Jul 1, 2026 05:291,654257,584,303240,276,0007,934,00016,801,792stderr
4Jul 1, 2026 05:291,654257,518,021240,191,0007,983,00016,801,792stderr
5Jul 1, 2026 05:291,655257,765,784240,296,0008,023,00016,801,792stderr
6Jul 1, 2026 05:291,655257,660,532240,237,0008,026,00016,801,792stderr
7Jul 1, 2026 05:291,658258,186,243240,798,0007,965,00016,801,792stderr
8Jul 1, 2026 05:291,658258,166,274240,797,0007,999,00016,801,792stderr
9Jul 1, 2026 05:291,659258,350,010240,921,0008,021,00016,801,792stderr