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 listApr 26, 2026 12:11Victor MerckléVictor MerckléScore: 4,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 12:114,002620,027,004594,344,0005,993,00017,031,168
2Apr 26, 2026 12:114,002616,672,029591,374,0008,990,00017,055,744
3Apr 26, 2026 12:114,003620,399,947590,610,0009,976,00017,031,168
4Apr 26, 2026 12:114,005618,394,827593,856,0006,986,00017,027,072
5Apr 26, 2026 12:114,006620,100,621588,974,00011,979,00017,027,072
6Apr 26, 2026 12:114,006619,766,731589,995,00010,981,00017,022,976
7Apr 26, 2026 12:114,012622,074,844589,932,00011,978,00017,018,880
8Apr 26, 2026 12:114,021623,840,983593,189,0009,986,00017,027,072
9Apr 26, 2026 12:114,021625,225,583595,273,0007,990,00017,018,880