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:03Andrew EpsteinAndrew EpsteinScore: 23,465Success
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:0423,4603,529,104,4253,464,391,00054,643,00016,801,792stderr
2Nov 4, 2026 01:0423,4613,529,140,7403,464,452,00054,755,00016,801,792stderr
3Nov 4, 2026 01:0423,4623,529,521,7433,464,134,00055,172,00016,801,792stderr
4Nov 4, 2026 01:0423,4623,529,103,4053,464,386,00055,023,00016,801,792stderr
5Nov 4, 2026 01:0423,4653,529,248,7143,465,170,00054,699,00016,801,792stderr
6Nov 4, 2026 01:0423,4683,529,614,8173,465,468,00054,736,00016,801,792stderr
7Nov 4, 2026 01:0423,5153,536,841,4263,472,032,00055,319,00016,801,792stderr
8Nov 4, 2026 01:0423,5163,537,345,8943,472,225,00055,180,00016,801,792stderr
9Nov 4, 2026 01:0423,5183,537,234,9243,472,519,00055,264,00016,801,792stderr