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 23:18M-RochatM-RochatScore: 4,069Success
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 23:194,054619,405,920585,747,00022,501,00016,793,600
2May 22, 2026 23:194,063618,801,732586,456,00023,095,00016,793,600
3May 22, 2026 23:194,063620,201,154586,518,00023,076,00016,793,600
4May 22, 2026 23:194,064622,180,474586,796,00022,921,00016,793,600
5May 22, 2026 23:194,069622,641,505587,382,00023,033,00016,793,600
6May 22, 2026 23:194,069622,060,794587,922,00022,446,00016,793,600
7May 22, 2026 23:194,072620,820,654587,549,00023,339,00016,793,600
8May 22, 2026 23:194,073620,231,977587,580,00023,463,00016,793,600
9May 22, 2026 23:194,076622,458,134588,162,00023,266,00016,793,600