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 22:12Aleksei ShahoikaAleksei ShahoikaScore: 3,826Success
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 22:133,824582,526,811568,364,0005,263,00016,793,600
2May 13, 2026 22:133,824583,988,704568,390,0005,244,00016,793,600
3May 13, 2026 22:133,825584,541,602568,637,0005,256,00016,793,600
4May 13, 2026 22:133,825582,812,132568,483,0005,401,00016,793,600
5May 13, 2026 22:133,826582,715,812568,635,0005,306,00016,793,600
6May 13, 2026 22:133,826582,802,500568,800,0005,245,00016,793,600
7May 13, 2026 22:133,828585,439,124569,054,0005,180,00016,793,600
8May 13, 2026 22:133,829583,698,942569,163,0005,261,00016,793,600
9May 13, 2026 22:133,830584,334,350569,281,0005,233,00016,793,600