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:58e1011e1011Score: 16,174Success
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 04:0716,1662,436,154,5822,408,141,00016,880,00016,793,600
2Oct 21, 2026 04:0716,1692,436,997,0492,408,692,00016,791,00016,793,600
3Oct 21, 2026 04:0716,1702,436,460,3202,408,791,00016,779,00016,793,600
4Oct 21, 2026 04:0716,1712,436,579,4942,408,787,00016,911,00016,793,600
5Oct 21, 2026 04:0716,1742,436,984,2932,409,169,00016,971,00016,793,600
6Oct 21, 2026 04:0716,1742,437,166,3432,409,176,00016,925,00016,793,600
7Oct 21, 2026 04:0716,1762,437,445,8832,409,728,00016,803,00016,793,600
8Oct 21, 2026 04:0716,1772,438,931,8622,409,910,00016,715,00016,793,600
9Oct 21, 2026 04:0716,1802,438,478,5532,410,134,00016,888,00016,793,600