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 listMar 21, 2026 04:20Dominique GarmierDominique GarmierScore: 4,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 04:204,264667,139,231610,622,00028,982,00017,203,200
2Mar 21, 2026 04:204,269668,491,501611,347,00028,969,00017,063,936
3Mar 21, 2026 04:204,269676,729,986611,385,00028,970,00017,162,240
4Mar 21, 2026 04:204,269667,080,132614,434,00025,976,00017,137,664
5Mar 21, 2026 04:204,270677,890,718614,537,00025,980,00017,018,880
6Mar 21, 2026 04:204,271667,489,789610,725,00029,986,00017,076,224
7Mar 21, 2026 04:204,272668,938,171616,757,00023,990,00017,084,416
8Mar 21, 2026 04:204,274672,887,874615,027,00026,001,00017,068,032
9Mar 21, 2026 04:204,282667,252,538615,303,00026,969,00017,080,320