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 23, 2026 01:09Dominique GarmierDominique GarmierScore: 4,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 01:094,035631,476,343580,171,00025,007,00017,154,048
2Mar 23, 2026 01:094,047639,282,498583,117,00024,004,00017,149,952
3Mar 23, 2026 01:094,057636,794,297585,582,00022,983,00017,203,200
4Mar 23, 2026 01:094,061638,560,305587,123,00022,004,00017,154,048
5Mar 23, 2026 01:094,064636,573,727586,653,00022,986,00017,158,144
6Mar 23, 2026 01:094,079640,100,394583,787,00027,989,00016,957,440
7Mar 23, 2026 01:094,081648,656,782591,181,00021,006,00017,059,840
8Mar 23, 2026 01:094,089641,390,315590,350,00022,974,00017,158,144
9Mar 23, 2026 01:094,092642,605,743590,836,00022,993,00017,010,688