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:39Victor MerckléVictor MerckléScore: 1,846Success
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:401,845295,402,030270,849,0005,996,00017,154,048
2Apr 26, 2026 16:401,845292,272,831269,810,0006,995,00017,145,856
3Apr 26, 2026 16:401,845289,674,766270,759,0005,994,00017,145,856
4Apr 26, 2026 16:401,845301,485,512270,771,0005,994,00017,154,048
5Apr 26, 2026 16:401,846294,070,400270,037,0007,000,00017,154,048
6Apr 26, 2026 16:401,846299,127,385269,903,0006,997,00017,063,936
7Apr 26, 2026 16:401,848289,256,859271,279,0006,006,00017,145,856
8Apr 26, 2026 16:401,851292,788,080272,785,0004,996,00017,149,952
9Apr 26, 2026 16:401,855296,648,220271,284,0007,007,00017,154,048