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 listOct 21, 2026 03:50e1011e1011Score: 22,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 03:5122,8503,438,421,3973,410,472,00017,087,00016,793,600
2Oct 21, 2026 03:5122,8513,438,697,3493,410,657,00017,095,00016,793,600
3Oct 21, 2026 03:5122,8683,441,179,0233,413,014,00017,212,00016,793,600
4Oct 21, 2026 03:5122,8743,442,510,9363,413,507,00017,625,00016,793,600
5Oct 21, 2026 03:5122,8753,442,314,5373,414,107,00017,158,00016,793,600
6Oct 21, 2026 03:5122,8903,444,670,7053,416,150,00017,447,00016,793,600
7Oct 21, 2026 03:5122,8923,444,847,8143,416,063,00017,775,00016,793,600
8Oct 21, 2026 03:5122,8953,445,246,9773,416,853,00017,472,00016,793,600
9Oct 21, 2026 03:5122,9013,446,154,2703,417,572,00017,685,00016,793,600