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 30, 2026 03:28Elijah KinElijah KinScore: 12,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:2912,8021,930,592,2081,882,692,00037,743,00016,793,600
2May 30, 2026 03:2912,8821,942,536,9661,894,802,00037,535,00016,793,600
3May 30, 2026 03:2912,8881,945,554,7581,896,202,00037,101,00016,793,600
4May 30, 2026 03:2912,8991,945,163,8931,896,463,00038,410,00016,793,600
5May 30, 2026 03:2912,9091,947,813,1301,898,032,00038,457,00016,793,600
6May 30, 2026 03:2912,9561,954,588,8381,904,923,00038,479,00016,793,600
7May 30, 2026 03:2912,9791,959,108,3591,907,682,00039,205,00016,793,600
8May 30, 2026 03:2913,0141,963,822,2121,913,376,00038,745,00016,793,600
9May 30, 2026 03:2913,0451,966,389,4581,917,918,00038,924,00016,793,600