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 15:46Dominique GarmierDominique GarmierScore: 3,798Success
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 15:463,788598,393,080544,162,00024,007,00017,043,456
2Mar 23, 2026 15:463,791595,486,957545,634,00022,984,00017,129,472
3Mar 23, 2026 15:463,795595,037,151541,191,00028,009,00017,203,200
4Mar 23, 2026 15:463,796604,743,517539,462,00029,970,00017,125,376
5Mar 23, 2026 15:463,798596,129,441541,703,00027,984,00017,047,552
6Mar 23, 2026 15:463,800601,940,605542,975,00026,998,00017,059,840
7Mar 23, 2026 15:463,805598,869,433549,727,00020,989,00017,035,264
8Mar 23, 2026 15:463,810595,144,384546,543,00024,979,00017,170,432
9Mar 23, 2026 15:463,832599,978,412549,757,00024,988,00017,047,552