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 11:13anboto1anboto1Score: 4,574Success
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 11:134,546691,830,501606,580,00075,449,00016,797,696
2Jun 24, 2026 11:134,549691,865,858607,645,00074,742,00016,797,696
3Jun 24, 2026 11:134,557693,404,787607,846,00075,754,00016,797,696
4Jun 24, 2026 11:134,562694,290,966607,431,00076,889,00016,797,696
5Jun 24, 2026 11:134,574695,752,222606,939,00079,173,00016,797,696
6Jun 24, 2026 11:134,578696,437,399608,211,00078,498,00016,797,696
7Jun 24, 2026 11:134,583697,363,277607,851,00079,688,00016,797,696
8Jun 24, 2026 11:134,594698,934,391609,355,00079,843,00016,797,696
9Jun 24, 2026 11:134,599699,724,561609,215,00080,723,00016,797,696