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 listSep 15, 2026 16:10Haha ExpertHaha ExpertScore: 4,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 16:114,394669,395,318650,061,0009,125,00016,793,600
2Sep 15, 2026 16:114,395669,668,647650,203,0009,154,00016,793,600
3Sep 15, 2026 16:114,399670,216,801650,870,0009,066,00016,793,600
4Sep 15, 2026 16:114,403670,867,354651,422,0009,167,00016,793,600
5Sep 15, 2026 16:114,404671,000,758651,587,0009,129,00016,793,600
6Sep 15, 2026 16:114,404670,955,685651,514,0009,143,00016,793,600
7Sep 15, 2026 16:114,407672,582,742652,025,0009,102,00016,793,600
8Sep 15, 2026 16:114,408671,649,157652,153,0009,110,00016,793,600
9Sep 15, 2026 16:114,411672,015,331652,631,0009,161,00016,793,600