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 listAug 23, 2026 17:25Navneet RajNavneet RajScore: 14,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:2614,1182,127,824,3192,104,130,00013,674,00016,793,600
2Aug 23, 2026 17:2614,2602,149,337,8732,125,430,00013,716,00016,793,600
3Aug 23, 2026 17:2614,4442,176,672,3482,153,131,00013,564,00016,793,600
4Aug 23, 2026 17:2614,4992,184,878,9312,161,553,00013,335,00016,793,600
5Aug 23, 2026 17:2614,9542,253,134,8892,229,690,00013,485,00016,793,600
6Aug 23, 2026 17:2614,9582,253,882,2152,230,167,00013,554,00016,793,600
7Aug 23, 2026 17:2614,9792,256,874,5352,233,331,00013,567,00016,793,600
8Aug 23, 2026 17:2615,2422,297,979,3952,272,222,00014,219,00016,793,600
9Aug 23, 2026 17:2615,4592,328,880,7762,305,423,00013,491,00016,793,600