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:10Andrew EpsteinAndrew EpsteinScore: 23,562Success
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:1123,5553,542,968,0743,478,767,00054,611,00016,801,792stderr
2Nov 4, 2026 01:1123,5603,543,438,1543,479,324,00054,686,00016,801,792stderr
3Nov 4, 2026 01:1123,5623,543,950,0483,479,692,00054,687,00016,801,792stderr
4Nov 4, 2026 01:1123,5623,543,862,5063,479,591,00054,758,00016,801,792stderr
5Nov 4, 2026 01:1123,5623,543,942,6453,479,514,00054,856,00016,801,792stderr
6Nov 4, 2026 01:1123,5643,544,268,3773,479,985,00054,698,00016,801,792stderr
7Nov 4, 2026 01:1123,6183,552,183,6333,487,393,00055,327,00016,801,792stderr
8Nov 4, 2026 01:1123,6203,552,423,8853,487,721,00055,295,00016,801,792stderr
9Nov 4, 2026 01:1123,6303,554,143,3913,489,272,00055,252,00016,801,792stderr