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 listFeb 16, 2026 18:14Valentin KofmanValentin KofmanScore: 4,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:144,175654,024,646614,341,00011,967,00017,195,008
2Feb 16, 2026 18:144,176653,884,149614,459,00011,969,00017,100,800
3Feb 16, 2026 18:144,178655,452,832616,744,0009,979,00016,949,248
4Feb 16, 2026 18:144,180652,394,835616,986,0009,983,00017,170,432
5Feb 16, 2026 18:144,188653,600,030618,213,0009,987,00017,035,264
6Feb 16, 2026 18:144,192655,333,209617,834,00010,979,00016,945,152
7Feb 16, 2026 18:144,199657,250,105620,859,0008,983,00017,047,552
8Feb 16, 2026 18:144,201655,551,632621,134,0008,987,00017,080,320
9Feb 16, 2026 18:144,208656,412,017621,183,0009,986,00017,186,816