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 listMay 1, 2026 06:34Charles CabergsCharles CabergsScore: 3,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 06:343,807592,659,381566,095,0005,000,00017,137,664
2May 1, 2026 06:343,809586,378,585565,495,0005,994,00016,994,304
3May 1, 2026 06:343,810590,129,279566,541,0004,995,00017,133,568
4May 1, 2026 06:343,811593,827,344565,775,0005,997,00016,990,208
5May 1, 2026 06:343,812590,385,141566,848,0004,998,00017,137,664
6May 1, 2026 06:343,812590,034,716565,934,0005,999,00017,137,664
7May 1, 2026 06:343,813592,756,182567,069,0005,000,00017,133,568
8May 1, 2026 06:343,813590,330,547566,954,0004,999,00016,994,304
9May 1, 2026 06:343,814591,331,914567,118,0005,001,00017,129,472