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 16, 2026 20:06Jasper EdbrookeJasper EdbrookeScore: 11,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 19:3611,5971,765,931,5401,630,689,000108,912,00017,072,128
2Apr 16, 2026 19:3611,6031,771,245,9761,640,511,00099,909,00016,994,304
3Apr 16, 2026 20:0611,6031,767,594,7691,641,570,00098,913,00017,223,680
4Apr 16, 2026 20:0611,6051,772,605,4581,635,918,000104,866,00017,039,360
5Apr 16, 2026 20:0611,6061,770,797,1591,645,981,00094,883,00017,084,416
6Apr 16, 2026 20:0611,6101,764,416,7491,642,515,00098,910,00017,121,280
7Apr 16, 2026 19:3611,6131,773,930,6051,641,025,000100,878,00017,047,552
8Apr 16, 2026 19:3611,6151,773,261,3801,642,319,00099,897,00017,088,512
9Apr 16, 2026 19:3611,6151,775,822,4731,629,346,000112,885,00017,039,360
10Apr 16, 2026 20:0611,6201,766,640,9291,629,050,000113,933,00016,961,536
11Apr 16, 2026 20:0611,6241,779,969,0551,635,669,000107,912,00016,982,016
12Apr 16, 2026 19:3611,6251,772,046,9421,634,914,000108,861,00017,055,744
13Apr 16, 2026 20:0611,6261,772,336,5661,618,243,000125,708,00017,215,488
14Apr 16, 2026 20:0611,6581,776,025,6081,639,869,000108,858,00017,010,688
15Apr 16, 2026 19:3611,6761,777,495,0271,645,623,000105,847,00017,096,704
16Apr 16, 2026 19:3611,7201,788,338,1281,661,063,00096,887,00016,998,400
17Apr 16, 2026 20:0611,7311,791,864,7241,658,716,000100,921,00016,998,400
18Apr 16, 2026 19:3611,7831,795,408,8261,646,597,000120,823,00017,145,856