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 07:25M-RochatM-RochatScore: 12,266Success
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 07:2911,9891,807,755,4641,776,892,00021,534,00016,793,600
2May 16, 2026 07:2911,9921,808,711,0781,777,065,00021,759,00016,793,600
3May 16, 2026 07:2912,0191,812,569,1021,781,585,00021,365,00016,793,600
4May 16, 2026 07:2912,1631,835,711,3101,803,068,00021,464,00016,793,600
5May 16, 2026 07:2912,2661,848,781,7231,818,477,00021,502,00016,793,600
6May 16, 2026 07:2912,5161,888,487,7341,855,297,00022,145,00016,793,600
7May 16, 2026 07:2912,7551,923,198,1131,891,868,00021,411,00016,793,600
8May 16, 2026 07:2913,3172,008,791,7141,975,940,00021,625,00016,793,600
9May 16, 2026 07:2913,5612,044,561,0692,011,896,00022,335,00016,793,600