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 22, 2026 22:56M-RochatM-RochatScore: 4,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 22:564,180638,633,496601,812,00025,318,00016,818,176
2May 22, 2026 22:564,182639,682,751602,270,00025,088,00016,805,888
3May 22, 2026 22:564,184639,182,610602,422,00025,261,00016,805,888
4May 22, 2026 22:564,186641,632,418603,036,00024,986,00016,805,888
5May 22, 2026 22:564,189640,530,953603,361,00025,060,00016,805,888
6May 22, 2026 22:564,190640,722,242603,413,00025,101,00016,805,888
7May 22, 2026 22:564,200643,496,803608,050,00022,058,00016,805,888
8May 22, 2026 22:564,201641,166,711605,364,00024,874,00016,818,176
9May 22, 2026 22:564,216644,578,504607,320,00025,093,00016,818,176