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 listMar 5, 2026 07:38DanielDanielScore: 3,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 07:383,977623,271,812579,621,00016,988,00017,092,608
2Mar 5, 2026 07:383,981622,103,827584,100,00013,002,00017,211,392
3Mar 5, 2026 07:383,983624,609,204584,430,00012,987,00016,957,440
4Mar 5, 2026 07:383,986623,389,998582,886,00014,997,00016,957,440
5Mar 5, 2026 07:383,986627,143,305584,946,00012,998,00017,211,392
6Mar 5, 2026 07:383,988623,277,011584,131,00014,003,00017,035,264
7Mar 5, 2026 07:383,989628,928,423586,307,00012,006,00017,006,592
8Mar 5, 2026 07:383,992622,266,068581,789,00016,993,00017,043,456
9Mar 5, 2026 07:383,993622,484,012582,971,00015,999,00017,055,744