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 listDec 28, 2024 01:23Joad NacerJoad NacerScore: 4,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 01:234,186651,301,200583,931,00043,994,00017,047,552
2Dec 28, 2024 01:234,186653,237,022588,960,00038,997,00017,047,552
3Dec 28, 2024 01:234,187651,173,580589,093,00039,006,00017,211,392
4Dec 28, 2024 01:234,189659,689,492587,278,00041,019,00017,166,336
5Dec 28, 2024 01:234,189660,516,530583,403,00044,954,00017,211,392
6Dec 28, 2024 01:234,190653,714,412584,557,00043,966,00016,990,208
7Dec 28, 2024 01:234,192654,333,176576,786,00051,980,00017,047,552
8Dec 28, 2024 01:234,192652,034,173583,827,00044,986,00017,055,744
9Dec 28, 2024 01:234,196658,248,895583,328,00046,025,00017,047,552