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:57M-RochatM-RochatScore: 4,262Success
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:574,259647,999,583615,905,00023,020,00016,793,600
2May 17, 2026 02:574,259649,701,146617,490,00021,446,00016,793,600
3May 17, 2026 02:574,261649,549,026617,420,00021,762,00016,793,600
4May 17, 2026 02:574,261648,593,492617,630,00021,595,00016,793,600
5May 17, 2026 02:574,262648,271,491617,569,00021,828,00016,793,600
6May 17, 2026 02:574,263648,542,391617,799,00021,777,00016,793,600
7May 17, 2026 02:574,263648,353,268617,653,00021,836,00016,793,600
8May 17, 2026 02:574,266650,578,675618,137,00021,905,00016,793,600
9May 17, 2026 02:574,268650,065,239617,484,00022,772,00016,793,600