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 4, 2026 22:06olliecrowolliecrowScore: 3,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 22:063,563558,334,498524,506,0009,990,00016,982,016
2Mar 4, 2026 22:063,563562,378,284521,527,00012,988,00017,186,816
3Mar 4, 2026 22:063,563559,594,738523,531,00010,990,00016,982,016
4Mar 4, 2026 22:063,564561,386,803520,581,00013,988,00017,055,744
5Mar 4, 2026 22:063,565558,660,778522,701,00011,993,00016,969,728
6Mar 4, 2026 22:063,565566,335,735522,765,00011,994,00016,990,208
7Mar 4, 2026 22:063,565559,939,628523,776,00010,995,00016,986,112
8Mar 4, 2026 22:063,567567,241,416523,997,00010,999,00016,977,920
9Mar 4, 2026 22:063,569569,038,780523,365,00011,985,00016,986,112