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 17:58Victor MerckléVictor MerckléScore: 1,869Success
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 18:031,866296,960,320272,924,0006,998,00017,235,968
2Apr 26, 2026 18:031,866300,081,022271,959,0007,998,00017,223,680
3Apr 26, 2026 18:031,867295,851,204273,050,0007,001,00017,240,064
4Apr 26, 2026 18:031,867296,401,897272,165,0008,004,00017,227,776
5Apr 26, 2026 18:031,869293,359,450272,393,0007,982,00017,031,168
6Apr 26, 2026 18:031,870295,250,663272,646,0007,989,00017,043,456
7Apr 26, 2026 18:031,873298,800,305273,981,0006,999,00017,235,968
8Apr 26, 2026 18:031,875298,866,746275,258,0006,005,00017,231,872
9Apr 26, 2026 18:031,876300,325,238272,505,0008,983,00017,059,840