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 listSep 10, 2026 03:13Andrew EpsteinAndrew EpsteinScore: 3,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 03:133,409521,617,023488,642,00022,785,00016,793,600
2Sep 10, 2026 03:133,411521,806,954488,833,00022,823,00016,793,600
3Sep 10, 2026 03:133,412522,412,777489,048,00022,866,00016,793,600
4Sep 10, 2026 03:133,414522,206,040489,399,00022,848,00016,793,600
5Sep 10, 2026 03:133,414522,233,130489,285,00022,835,00016,793,600
6Sep 10, 2026 03:133,414522,298,716489,425,00022,764,00016,793,600
7Sep 10, 2026 03:133,414522,342,427489,201,00022,918,00016,793,600
8Sep 10, 2026 03:133,419522,986,057489,393,00023,488,00016,793,600
9Sep 10, 2026 03:133,426524,446,411490,473,00023,555,00016,793,600