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 20, 2026 16:58M-RochatM-RochatScore: 11,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:5910,2461,548,122,3111,516,088,00020,884,00016,793,600
2May 20, 2026 16:5911,5261,739,726,3321,706,297,00022,603,00016,797,696
3May 20, 2026 16:5911,5581,743,773,4031,712,605,00021,222,00016,793,600
4May 20, 2026 16:5911,6421,757,613,4331,725,262,00021,146,00016,793,600
5May 20, 2026 16:5911,6471,759,287,6641,725,868,00021,210,00016,793,600
6May 20, 2026 16:5911,6481,757,613,3021,725,971,00021,319,00016,793,600
7May 20, 2026 16:5911,6821,764,558,0801,731,151,00021,285,00016,793,600
8May 20, 2026 16:5911,7081,770,006,5521,734,840,00021,458,00016,793,600
9May 20, 2026 16:5911,7191,767,709,6581,736,602,00021,274,00016,793,600