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 17, 2026 02:53M-RochatM-RochatScore: 4,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:544,268650,611,034618,602,00021,668,00016,793,600
2May 17, 2026 02:544,271651,743,028619,196,00021,505,00016,793,600
3May 17, 2026 02:544,275650,107,691619,395,00021,874,00016,793,600
4May 17, 2026 02:544,275650,312,475619,607,00021,778,00016,793,600
5May 17, 2026 02:544,279651,097,200618,975,00023,023,00016,793,600
6May 17, 2026 02:544,281653,988,337619,144,00023,056,00016,793,600
7May 17, 2026 02:544,293654,775,890622,308,00021,717,00016,793,600
8May 17, 2026 02:544,305656,063,034623,777,00021,976,00016,793,600
9May 17, 2026 02:544,345667,895,923628,820,00022,980,00016,793,600