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:41Jasper EdbrookeJasper EdbrookeScore: 11,454Success
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 20:4111,4241,739,258,2061,622,610,00090,922,00017,018,880
2Apr 16, 2026 20:4111,4381,754,604,9861,624,795,00090,876,00017,035,264
3Apr 16, 2026 20:4111,4471,746,296,0401,623,152,00093,893,00017,100,800
4Apr 16, 2026 20:4111,4491,751,927,2141,626,469,00090,914,00016,953,344
5Apr 16, 2026 20:4111,4541,749,295,2961,632,264,00085,908,00017,108,992
6Apr 16, 2026 20:4111,4561,749,690,2511,628,451,00089,914,00017,031,168
7Apr 16, 2026 20:4111,4581,750,128,7501,637,733,00080,937,00016,994,304
8Apr 16, 2026 20:4111,4681,745,427,5501,618,299,000101,892,00017,207,296
9Apr 16, 2026 20:4111,4731,748,313,8401,647,967,00072,954,00016,994,304