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 listJan 5, 2026 02:14Josu San MartinJosu San MartinScore: 3,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 02:143,337525,601,521460,593,00039,964,00017,059,840
2Jan 5, 2026 02:143,342535,564,698463,339,00037,945,00017,072,128
3Jan 5, 2026 02:143,342529,078,559460,401,00040,946,00017,068,032
4Jan 5, 2026 02:143,344529,923,230463,564,00037,964,00017,084,416
5Jan 5, 2026 02:143,344529,115,699463,642,00037,970,00016,961,536
6Jan 5, 2026 02:143,345529,555,618464,767,00036,981,00017,145,856
7Jan 5, 2026 02:143,347525,703,534463,010,00039,000,00017,125,376
8Jan 5, 2026 02:143,352533,946,981461,767,00040,979,00017,072,128
9Jan 5, 2026 02:143,353530,872,044464,937,00037,994,00017,190,912