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,239Success
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,229662,707,295605,409,00028,971,00017,211,392
2Mar 21, 2026 04:204,233657,101,093606,911,00027,995,00017,240,064
3Mar 21, 2026 04:204,235668,719,085608,175,00027,007,00017,297,408
4Mar 21, 2026 04:204,236664,058,610610,367,00024,974,00017,125,376
5Mar 21, 2026 04:204,239667,929,164608,831,00026,992,00017,137,664
6Mar 21, 2026 04:204,241667,627,495607,089,00029,004,00017,223,680
7Mar 21, 2026 04:204,241666,090,430607,089,00029,004,00017,235,968
8Mar 21, 2026 04:204,242669,523,983605,349,00030,966,00017,227,776
9Mar 21, 2026 04:204,245663,017,924609,738,00026,988,00017,305,600