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 17, 2026 09:54M-RochatM-RochatScore: 23,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 09:5522,8423,435,372,4363,401,233,00025,107,00016,793,600
2May 17, 2026 09:5522,8583,440,851,2523,403,748,00025,058,00016,793,600
3May 17, 2026 09:5522,9083,448,031,9643,411,038,00025,205,00016,793,600
4May 17, 2026 09:5523,0133,461,057,1643,426,847,00025,117,00016,793,600
5May 17, 2026 09:5523,0153,461,789,7243,426,938,00025,317,00016,793,600
6May 17, 2026 09:5523,0273,463,538,2893,429,083,00025,067,00016,793,600
7May 17, 2026 09:5523,1273,478,045,4423,443,662,00025,498,00016,793,600
8May 17, 2026 09:5523,1903,488,153,2083,453,443,00025,172,00016,793,600
9May 17, 2026 09:5523,2113,490,938,6043,456,740,00025,035,00016,793,600