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 20, 2026 21:17Dominique GarmierDominique GarmierScore: 40,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 18:4740,5056,113,462,5236,032,874,00042,935,00017,043,456
2Mar 20, 2026 18:4740,5506,117,627,4906,028,534,00053,942,00017,203,200
3Mar 20, 2026 18:4740,5756,119,280,3936,026,278,00059,913,00017,014,784
4Mar 20, 2026 18:4740,6006,132,177,2006,042,078,00047,929,00017,043,456
5Mar 20, 2026 18:4740,6136,127,357,6786,059,979,00031,962,00017,076,224
6Mar 20, 2026 21:1740,6956,139,450,2396,055,385,00048,938,00017,059,840
7Mar 20, 2026 18:4740,9516,187,959,7466,093,765,00048,957,00017,203,200
8Mar 20, 2026 21:1741,1126,199,520,0716,116,919,00049,934,00017,039,360
9Mar 20, 2026 21:1741,1836,228,941,5586,138,532,00038,933,00017,129,472