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 listNov 4, 2026 01:35Andrew EpsteinAndrew EpsteinScore: 23,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 01:3623,3903,518,196,0593,453,415,00055,176,00016,801,792stderr
2Nov 4, 2026 01:3623,3943,518,549,6313,454,295,00054,821,00016,801,792stderr
3Nov 4, 2026 01:3623,4013,519,767,0293,455,079,00055,113,00016,801,792stderr
4Nov 4, 2026 01:3623,4013,520,176,1303,454,756,00055,504,00016,801,792stderr
5Nov 4, 2026 01:3623,4023,519,768,5363,455,467,00054,893,00016,801,792stderr
6Nov 4, 2026 01:3623,4513,527,051,6093,462,418,00055,275,00016,801,792stderr
7Nov 4, 2026 01:3623,4573,528,103,4393,463,190,00055,412,00016,801,792stderr
8Nov 4, 2026 01:3623,5593,552,536,0213,478,629,00055,354,00016,801,792stderr
9Nov 4, 2026 01:3623,6823,562,820,0183,496,857,00055,562,00016,801,792stderr