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 listJan 5, 2026 05:12Josu San MartinJosu San MartinScore: 3,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 05:123,058487,291,541420,713,00037,974,00016,986,112
2Jan 5, 2026 05:123,063486,414,758419,540,00039,956,00016,953,344
3Jan 5, 2026 05:123,065488,867,928422,780,00036,980,00017,055,744
4Jan 5, 2026 05:123,066492,410,259422,845,00036,986,00017,100,800
5Jan 5, 2026 05:123,068492,949,585419,277,00040,929,00016,957,440
6Jan 5, 2026 05:123,068484,729,270423,231,00037,020,00017,068,032
7Jan 5, 2026 05:123,072486,180,974423,860,00036,987,00017,068,032
8Jan 5, 2026 05:123,076487,331,376419,442,00041,944,00016,977,920
9Jan 5, 2026 05:123,880608,294,942544,039,00038,002,00016,969,728