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:34DanielDanielScore: 4,030Success
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:344,021626,617,677591,091,00012,001,00017,186,816
2Mar 5, 2026 05:344,021631,234,883584,129,00019,004,00017,100,800
3Mar 5, 2026 05:344,023628,020,796590,526,00012,989,00016,953,344
4Mar 5, 2026 05:344,027640,283,147589,103,00015,002,00017,141,760
5Mar 5, 2026 05:344,030630,212,328590,569,00013,989,00017,207,296
6Mar 5, 2026 05:344,034629,565,463590,038,00015,000,00016,953,344
7Mar 5, 2026 05:344,035633,245,596591,268,00014,006,00016,998,400
8Mar 5, 2026 05:344,037634,299,771586,542,00018,985,00017,051,648
9Mar 5, 2026 05:344,039634,586,782593,811,00011,996,00017,211,392