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:53Andrew EpsteinAndrew EpsteinScore: 15,457Success
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:5415,4512,327,134,1692,279,413,00038,312,00016,801,792stderr
2Nov 4, 2026 02:5415,4512,327,036,7652,279,585,00038,079,00016,801,792stderr
3Nov 4, 2026 02:5415,4532,327,545,6732,279,996,00038,076,00016,801,792stderr
4Nov 4, 2026 02:5415,4542,328,239,8582,279,709,00038,479,00016,801,792stderr
5Nov 4, 2026 02:5415,4572,328,183,3842,280,384,00038,246,00016,801,792stderr
6Nov 4, 2026 02:5415,4602,328,964,2742,280,742,00038,326,00016,801,792stderr
7Nov 4, 2026 02:5415,4882,332,746,7172,284,724,00038,584,00016,801,792stderr
8Nov 4, 2026 02:5415,4892,333,320,3672,284,911,00038,577,00016,801,792stderr
9Nov 4, 2026 02:5415,4902,333,439,2882,284,933,00038,627,00016,801,792stderr