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 30, 2026 04:07Elijah KinElijah KinScore: 4,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 04:084,834734,961,010701,244,00023,931,00016,793,600
2May 30, 2026 04:084,836736,862,298701,160,00024,328,00016,793,600
3May 30, 2026 04:084,837735,807,205701,507,00024,073,00016,793,600
4May 30, 2026 04:084,842738,632,302702,064,00024,293,00016,793,600
5May 30, 2026 04:084,843736,321,116702,309,00024,243,00016,793,600
6May 30, 2026 04:084,843736,473,690702,425,00024,118,00016,793,600
7May 30, 2026 04:084,846737,041,443702,988,00024,059,00016,793,600
8May 30, 2026 04:084,847738,321,976702,800,00024,329,00016,793,600
9May 30, 2026 04:084,850738,370,046703,622,00023,893,00016,793,600