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 23, 2026 04:17Dominique GarmierDominique GarmierScore: 5,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 04:175,000778,088,649739,018,00011,000,00016,953,344
2Mar 23, 2026 00:515,003774,876,889736,420,00013,988,00016,990,208
3Mar 23, 2026 00:515,003774,659,335736,432,00013,989,00016,986,112
4Mar 23, 2026 04:175,005778,852,148738,699,00011,995,00016,990,208
5Mar 23, 2026 04:175,009781,892,625735,379,00015,986,00016,953,344
6Mar 23, 2026 00:515,029781,749,491739,417,00014,988,00017,149,952