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 listMay 13, 2026 21:57Aleksei ShahoikaAleksei ShahoikaScore: 4,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:574,719718,062,067702,274,0005,652,00016,797,696
2May 13, 2026 21:574,722718,568,682702,632,0005,686,00016,797,696
3May 13, 2026 21:574,723719,596,347702,844,0005,656,00016,797,696
4May 13, 2026 21:574,725718,060,193703,158,0005,622,00016,797,696
5May 13, 2026 21:574,726718,606,175703,317,0005,623,00016,797,696
6May 13, 2026 21:574,726720,012,425703,374,0005,645,00016,797,696
7May 13, 2026 21:574,728718,556,344703,503,0005,708,00016,797,696
8May 13, 2026 21:574,735719,918,670704,638,0005,642,00016,797,696
9May 13, 2026 21:574,738720,290,230705,059,0005,695,00016,797,696