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:03Victor 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:061,842294,605,098270,432,0005,987,00017,158,144
2Apr 26, 2026 16:061,844300,124,961270,673,0005,992,00017,051,648
3Apr 26, 2026 16:061,845292,329,877269,864,0006,996,00017,141,760
4Apr 26, 2026 16:061,846294,152,490270,967,0005,999,00017,022,976
5Apr 26, 2026 16:061,846294,392,393269,974,0006,999,00017,137,664
6Apr 26, 2026 16:061,847296,871,856271,074,0006,001,00017,027,072
7Apr 26, 2026 16:061,850297,554,587271,560,0005,990,00017,149,952
8Apr 26, 2026 16:061,851293,647,646270,662,0006,991,00017,154,048
9Apr 26, 2026 16:061,852300,453,887271,899,0005,997,00017,035,264