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:40Haha ExpertHaha ExpertScore: 4,246Success
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:414,239646,274,831626,823,0009,118,00016,793,600
2Sep 15, 2026 16:414,241646,375,479627,081,0009,093,00016,797,696
3Sep 15, 2026 16:414,241646,518,000627,129,0009,080,00016,793,600
4Sep 15, 2026 16:414,245647,619,825627,777,0009,067,00016,793,600
5Sep 15, 2026 16:414,246647,264,536627,959,0009,063,00016,793,600
6Sep 15, 2026 16:414,246647,172,891627,905,0009,025,00016,793,600
7Sep 15, 2026 16:414,247647,443,817628,063,0009,076,00016,793,600
8Sep 15, 2026 16:414,247647,384,727627,976,0009,102,00016,793,600
9Sep 15, 2026 16:414,263649,731,414630,533,0009,024,00016,793,600