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 20, 2026 17:14M-RochatM-RochatScore: 4,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:154,123628,633,212597,235,00021,267,00016,793,600
2May 20, 2026 17:154,123629,549,653597,290,00021,264,00016,793,600
3May 20, 2026 17:154,127631,997,776597,748,00021,338,00016,793,600
4May 20, 2026 17:154,129628,763,472598,109,00021,358,00016,793,600
5May 20, 2026 17:154,131629,981,197598,400,00021,380,00016,793,600
6May 20, 2026 17:154,132631,191,997598,538,00021,378,00016,793,600
7May 20, 2026 17:154,136631,544,040598,068,00022,347,00016,793,600
8May 20, 2026 17:154,143632,815,359600,207,00021,367,00016,793,600
9May 20, 2026 17:154,147633,142,164601,112,00020,968,00016,793,600