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 02:25Andrew EpsteinAndrew EpsteinScore: 18,785Success
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 02:2618,7762,826,402,5242,766,124,00050,403,00016,805,888stderr
2Nov 4, 2026 02:2618,7802,826,653,3262,766,494,00050,640,00016,801,792stderr
3Nov 4, 2026 02:2618,7822,829,634,2162,766,995,00050,410,00016,801,792stderr
4Nov 4, 2026 02:2618,7832,827,431,9712,766,896,00050,623,00016,801,792stderr
5Nov 4, 2026 02:2618,7852,827,786,2752,767,264,00050,581,00016,805,888stderr
6Nov 4, 2026 02:2618,7902,828,826,9182,767,117,00051,518,00016,801,792stderr
7Nov 4, 2026 02:2618,8202,833,027,9542,772,139,00050,946,00016,805,888stderr
8Nov 4, 2026 02:2618,8232,833,428,7432,772,553,00051,019,00016,805,888stderr
9Nov 4, 2026 02:2618,8232,832,968,4092,772,391,00051,087,00016,805,888stderr