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 05:33DanielDanielScore: 4,158Success
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 05:334,147648,410,589606,102,00016,002,00017,211,392
2Mar 5, 2026 05:334,147646,572,734605,116,00017,003,00017,068,032
3Mar 5, 2026 05:334,154654,836,997611,079,00012,001,00017,145,856
4Mar 5, 2026 05:334,156650,813,705608,437,00014,986,00016,990,208
5Mar 5, 2026 05:334,158650,719,256604,657,00018,989,00016,994,304
6Mar 5, 2026 05:334,163648,445,959605,395,00018,981,00017,195,008
7Mar 5, 2026 05:334,163649,622,513608,433,00015,985,00017,113,088
8Mar 5, 2026 05:334,163656,390,877612,489,00011,990,00016,953,344
9Mar 5, 2026 05:334,183655,541,079612,470,00014,987,00017,211,392