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 listApr 16, 2026 20:44Jasper EdbrookeJasper EdbrookeScore: 11,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 20:4411,4461,745,283,1271,623,973,00092,884,00017,059,840
2Apr 16, 2026 20:4411,4521,756,815,7151,612,953,000104,866,00017,047,552
3Apr 16, 2026 20:4411,4571,745,496,4611,627,569,00090,920,00017,051,648
4Apr 16, 2026 20:4411,4611,743,919,8731,622,255,00096,895,00016,986,112
5Apr 16, 2026 20:4411,4651,751,678,0441,634,876,00084,889,00017,055,744
6Apr 16, 2026 20:4411,4721,752,457,9931,635,801,00084,937,00017,158,144
7Apr 16, 2026 20:4411,4731,752,553,2861,641,098,00079,907,00017,215,488
8Apr 16, 2026 20:4411,4771,751,541,3681,636,551,00084,924,00017,141,760
9Apr 16, 2026 20:4411,4781,753,929,2531,631,804,00089,879,00017,125,376