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 26, 2026 15:18Victor MerckléVictor MerckléScore: 1,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:191,928309,091,620278,283,00011,011,00017,084,416
2Apr 26, 2026 15:191,933310,412,795277,981,00011,999,00017,227,776
3Apr 26, 2026 15:191,935307,751,481278,273,00012,011,00017,088,512
4Apr 26, 2026 15:191,936305,548,041278,497,00011,978,00017,084,416
5Apr 26, 2026 15:191,937309,537,516277,617,00012,982,00017,096,704
6Apr 26, 2026 15:191,938309,987,427277,779,00012,989,00017,084,416
7Apr 26, 2026 15:191,940309,631,257280,046,00011,001,00017,092,608
8Apr 26, 2026 15:191,945311,969,790278,818,00012,991,00017,006,592
9Apr 26, 2026 15:191,950307,603,805279,575,00012,980,00017,084,416