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 17:56M-RochatM-RochatScore: 4,134Success
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 17:564,127628,879,832597,027,00022,152,00016,793,600
2May 22, 2026 17:564,129629,266,346597,352,00022,047,00016,793,600
3May 22, 2026 17:564,130630,847,214597,430,00022,190,00016,793,600
4May 22, 2026 17:564,131630,175,060597,483,00022,228,00016,793,600
5May 22, 2026 17:564,134630,890,495597,966,00022,233,00016,793,600
6May 22, 2026 17:564,158635,004,733601,659,00022,077,00016,793,600
7May 22, 2026 17:564,174638,533,813604,392,00021,837,00016,793,600
8May 22, 2026 17:564,196639,954,261607,613,00021,897,00016,793,600
9May 22, 2026 17:564,223644,724,947611,340,00022,190,00016,793,600