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 04:12M-RochatM-RochatScore: 6,713Success
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 04:136,7071,015,805,115984,604,00021,460,00016,793,600
2May 17, 2026 04:136,7081,015,946,910984,794,00021,481,00016,793,600
3May 17, 2026 04:136,7121,015,696,185985,422,00021,457,00016,793,600
4May 17, 2026 04:136,7131,016,923,621985,584,00021,422,00016,793,600
5May 17, 2026 04:136,7131,016,059,558985,418,00021,554,00016,793,600
6May 17, 2026 04:136,7151,018,419,785985,638,00021,658,00016,793,600
7May 17, 2026 04:136,7151,018,404,334985,827,00021,495,00016,793,600
8May 17, 2026 04:136,7161,016,457,944986,043,00021,480,00016,793,600
9May 17, 2026 04:136,7191,017,793,298986,190,00021,690,00016,793,600