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 listApr 26, 2026 16:30Victor MerckléVictor MerckléScore: 40,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:3340,4166,079,283,3115,989,648,00072,898,00017,055,744
2Apr 26, 2026 16:3340,4186,080,566,6325,991,832,00070,891,00017,010,688
3Apr 26, 2026 16:3340,4296,090,096,8006,001,457,00062,899,00017,186,816
4Apr 26, 2026 16:3340,4526,094,098,0956,006,012,00061,907,00017,047,552
5Apr 26, 2026 16:3340,4816,090,787,6806,013,296,00058,914,00017,256,448
6Apr 26, 2026 16:3340,4946,092,487,0626,012,341,00061,900,00017,129,472
7Apr 26, 2026 16:3340,4976,091,692,0616,020,665,00053,925,00017,240,064
8Apr 26, 2026 16:3340,5236,095,632,2636,025,563,00052,925,00017,047,552
9Apr 26, 2026 16:3340,5976,122,196,1016,033,633,00055,931,00017,145,856