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 15:26Victor MerckléVictor MerckléScore: 3,881Success
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 15:283,873610,129,960572,036,0009,016,00017,137,664
2Apr 26, 2026 15:283,881600,344,016572,276,0009,987,00017,014,784
3Apr 26, 2026 15:283,881590,938,700575,279,0007,003,00017,092,608
4Apr 26, 2026 15:283,881590,734,906572,158,00010,002,00017,129,472
5Apr 26, 2026 15:283,881591,178,951571,218,00010,984,00017,117,184
6Apr 26, 2026 15:283,884591,456,763573,706,0008,995,00017,129,472
7Apr 26, 2026 15:283,885591,375,058574,791,0007,997,00017,072,128
8Apr 26, 2026 15:283,885591,556,476573,851,0008,997,00017,072,128
9Apr 26, 2026 15:283,889591,147,680573,458,0009,990,00017,092,608