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 31, 2026 00:37Elijah KinElijah KinScore: 4,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2026 00:374,745722,847,396689,366,00022,388,00016,793,600
2May 31, 2026 00:374,754723,325,321690,752,00022,396,00016,793,600
3May 31, 2026 00:374,775727,072,486693,927,00022,419,00016,793,600
4May 31, 2026 00:374,808732,286,520698,859,00022,404,00016,793,600
5May 31, 2026 00:374,825733,766,588701,340,00022,459,00016,793,600
6May 31, 2026 00:374,832735,578,233702,530,00022,396,00016,793,600
7May 31, 2026 00:375,772876,451,112842,749,00023,102,00016,793,600
8May 31, 2026 00:375,790877,952,031845,529,00023,059,00016,793,600
9May 31, 2026 00:375,836886,550,259852,532,00023,013,00016,793,600