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 19:59olliecrowolliecrowScore: 3,868Success
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 19:593,866611,255,390565,921,00013,998,00016,949,248
2Mar 4, 2026 19:593,866608,289,024567,943,00011,998,00016,945,152
3Mar 4, 2026 19:593,867610,393,172567,041,00013,000,00017,182,720
4Mar 4, 2026 19:593,868606,480,297570,175,00010,003,00016,953,344
5Mar 4, 2026 19:593,868605,687,066568,220,00012,004,00017,186,816
6Mar 4, 2026 19:593,870604,123,567573,532,0006,994,00016,949,248
7Mar 4, 2026 19:593,873613,096,425569,915,00010,998,00017,186,816
8Mar 4, 2026 19:593,874607,571,890570,047,00010,981,00017,092,608
9Mar 4, 2026 19:593,893610,078,839576,974,0006,999,00017,170,432