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 listJun 24, 2026 09:15anboto1anboto1Score: 43,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 09:1743,3066,505,806,0246,443,092,00052,911,00017,391,616
2Jun 24, 2026 09:1743,3076,506,133,0486,442,068,00054,053,00017,436,672
3Jun 24, 2026 09:1743,3176,507,452,0496,444,564,00053,095,00017,289,216
4Jun 24, 2026 09:1743,3316,509,985,5176,441,093,00058,657,00017,432,576
5Jun 24, 2026 09:1743,3466,512,769,1946,442,942,00058,962,00017,412,096
6Jun 24, 2026 09:1743,5126,536,747,7156,473,309,00053,496,00017,387,520
7Jun 24, 2026 09:1743,5276,538,906,9426,475,187,00053,897,00017,436,672
8Jun 24, 2026 09:1743,6466,556,734,5936,488,327,00058,578,00017,412,096
9Jun 24, 2026 09:1743,7276,568,869,8286,502,192,00056,912,00017,424,384