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 27, 2026 23:29Victor MerckléVictor MerckléScore: 13,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 23:3013,0661,979,075,1661,932,036,00027,942,00017,223,680stderr
2Apr 27, 2026 23:3013,0731,983,543,3131,933,033,00027,942,00017,227,776stderr
3Apr 27, 2026 23:3013,0861,983,654,5371,933,982,00028,939,00017,117,184stderr
4Apr 27, 2026 23:3013,1021,988,299,6121,937,472,00027,934,00017,227,776stderr
5Apr 27, 2026 23:3013,2822,020,049,2471,963,490,00028,933,00017,031,168stderr
6Apr 27, 2026 23:3013,2872,014,782,3101,966,224,00026,948,00017,022,976stderr
7Apr 27, 2026 23:3013,2952,020,517,6241,970,348,00023,955,00017,031,168stderr
8Apr 27, 2026 23:3013,3572,026,626,8121,973,705,00029,934,00017,031,168stderr
9Apr 27, 2026 23:3014,2312,161,709,3722,110,811,00023,952,00017,035,264stderr