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 16, 2026 16:16M-RochatM-RochatScore: 7,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 16:177,0151,063,037,1251,030,964,00021,371,00016,793,600
2May 16, 2026 16:177,0171,061,506,0621,031,085,00021,569,00016,793,600
3May 16, 2026 16:177,0171,064,241,1431,031,269,00021,311,00016,793,600
4May 16, 2026 16:177,0171,062,478,6861,031,046,00021,584,00016,793,600
5May 16, 2026 16:177,0181,064,642,6661,031,406,00021,370,00016,793,600
6May 16, 2026 16:177,0571,068,076,2021,037,325,00021,347,00016,793,600
7May 16, 2026 16:177,0601,069,941,8891,037,583,00021,450,00016,793,600
8May 16, 2026 16:177,2021,091,077,1921,059,348,00020,961,00016,793,600
9May 16, 2026 16:177,2541,097,853,8451,067,062,00021,113,00016,793,600