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:39DanielDanielScore: 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:373,976621,893,739579,489,00016,985,00016,953,344
2Mar 5, 2026 07:373,979624,213,265582,874,00013,996,00017,035,264
3Mar 5, 2026 07:373,983624,216,356585,395,00012,008,00017,207,296
4Mar 5, 2026 07:393,984631,178,637587,546,0009,992,00017,047,552
5Mar 5, 2026 07:373,985626,542,045584,784,00012,995,00016,994,304
6Mar 5, 2026 07:373,985622,213,840583,812,00013,995,00017,047,552
7Mar 5, 2026 07:373,986621,498,532584,972,00012,999,00016,957,440
8Mar 5, 2026 07:373,987623,643,916585,118,00013,002,00016,969,728
9Mar 5, 2026 07:373,988637,180,410584,141,00014,003,00017,035,264
10Mar 5, 2026 07:373,991629,863,279582,637,00015,990,00017,195,008
11Mar 5, 2026 07:393,992622,994,109580,822,00017,994,00016,986,112
12Mar 5, 2026 07:393,993622,156,764584,937,00013,998,00017,211,392