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 23:17Aleksei ShahoikaAleksei ShahoikaScore: 3,277Success
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 23:183,272502,161,221485,235,0005,660,00016,797,696
2May 13, 2026 23:183,274499,836,385485,203,0006,016,00016,797,696
3May 13, 2026 23:183,275501,836,535485,625,0005,679,00016,797,696
4May 13, 2026 23:183,275500,602,546485,621,0005,730,00016,797,696
5May 13, 2026 23:183,277502,462,340486,017,0005,617,00016,797,696
6May 13, 2026 23:183,279502,978,901486,224,0005,654,00016,797,696
7May 13, 2026 23:183,280502,551,519486,174,0005,830,00016,797,696
8May 13, 2026 23:183,281502,705,725486,491,0005,736,00016,797,696
9May 13, 2026 23:183,283502,887,985486,599,0005,878,00016,797,696