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 00:47e1011e1011Score: 63,092Success
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 00:4962,9239,449,528,5219,413,811,00024,760,00016,793,600
2Oct 21, 2026 00:4962,9959,460,397,3949,423,919,00025,380,00016,793,600
3Oct 21, 2026 00:4963,0369,466,334,5499,431,011,00024,482,00016,793,600
4Oct 21, 2026 00:4963,0889,474,262,5279,438,078,00025,218,00016,793,600
5Oct 21, 2026 00:4963,0929,475,063,6779,438,839,00025,019,00016,793,600
6Oct 21, 2026 00:4963,1009,476,438,6009,439,921,00025,158,00016,793,600
7Oct 21, 2026 00:4963,5879,548,962,3989,513,133,00025,019,00016,793,600
8Oct 21, 2026 00:4963,6109,552,523,0799,516,837,00024,700,00016,793,600
9Oct 21, 2026 00:4964,2519,649,059,9929,613,399,00024,313,00016,793,600