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 27, 2026 23:25Dominique GarmierDominique GarmierScore: 3,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 23:253,278514,914,273466,658,00024,981,00016,953,344
2Mar 27, 2026 23:253,281518,393,888466,160,00026,008,00017,154,048
3Mar 27, 2026 23:253,286518,947,934464,837,00027,990,00017,195,008
4Mar 27, 2026 23:253,290522,184,722470,586,00022,979,00017,014,784
5Mar 27, 2026 23:253,292521,324,601469,777,00023,988,00017,051,648
6Mar 27, 2026 23:253,296527,933,360467,381,00026,964,00016,986,112
7Mar 27, 2026 23:253,297526,943,753466,604,00027,976,00017,035,264
8Mar 27, 2026 23:253,299524,052,010463,818,00030,987,00017,002,496
9Mar 27, 2026 23:253,303528,417,883468,410,00026,966,00017,059,840