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 22, 2026 14:00BenBenScore: 4,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 14:004,103633,149,179591,535,00023,981,00017,174,528
2Apr 22, 2026 14:004,124635,373,976593,638,00024,984,00017,162,240
3Apr 22, 2026 14:004,150640,100,224599,593,00022,984,00017,158,144
4Apr 22, 2026 14:004,153643,722,232598,073,00025,003,00017,166,336
5Apr 22, 2026 14:004,156642,204,021598,489,00024,978,00017,190,912
6Apr 22, 2026 14:004,158640,005,678600,821,00022,993,00017,162,240
7Apr 22, 2026 14:004,159642,863,904598,881,00024,995,00017,166,336
8Apr 22, 2026 14:004,160645,981,082601,128,00023,004,00016,990,208
9Apr 22, 2026 14:004,165642,732,528600,823,00023,992,00017,162,240