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 10, 2026 05:15olliecrowolliecrowScore: 3,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 05:153,430540,148,452508,579,0005,995,00017,141,760
2Mar 10, 2026 05:153,431539,512,064508,647,0005,995,00017,084,416
3Mar 10, 2026 05:153,432546,879,950509,856,0004,998,00017,035,264
4Mar 10, 2026 05:153,433543,623,843507,951,0006,999,00017,055,744
5Mar 10, 2026 05:153,434543,170,134510,117,0005,001,00016,982,016
6Mar 10, 2026 05:153,434540,595,823508,145,0007,002,00016,998,400
7Mar 10, 2026 05:153,436540,577,907508,337,0006,990,00017,145,856
8Mar 10, 2026 05:153,449549,085,622508,371,0008,988,00017,002,496
9Mar 10, 2026 05:153,490548,625,195515,564,0007,993,00016,994,304