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:26Haha ExpertHaha ExpertScore: 4,258Success
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:294,254648,437,102629,053,0009,137,00016,793,600
2Sep 15, 2026 16:294,256648,866,837629,389,0009,057,00016,793,600
3Sep 15, 2026 16:294,256648,715,220629,380,0009,114,00016,793,600
4Sep 15, 2026 16:294,257648,878,998629,605,0009,039,00016,793,600
5Sep 15, 2026 16:294,258649,014,147629,666,0009,182,00016,793,600
6Sep 15, 2026 16:294,259649,212,463629,773,0009,175,00016,793,600
7Sep 15, 2026 16:294,261649,445,444630,145,0009,067,00016,793,600
8Sep 15, 2026 16:294,265649,990,602630,716,0009,052,00016,793,600
9Sep 15, 2026 16:294,267650,304,701631,015,0009,078,00016,793,600