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 22, 2026 00:54olliecrowolliecrowScore: 4,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 00:564,305654,065,384621,793,00023,992,00017,248,256
2Apr 22, 2026 00:564,317668,873,274624,577,00022,984,00017,231,872
3Apr 22, 2026 00:564,330665,795,034623,559,00025,981,00017,231,872
4Apr 22, 2026 00:564,347661,390,924625,171,00026,964,00017,027,072
5Apr 22, 2026 00:564,359662,113,218620,009,00033,945,00017,117,184
6Apr 22, 2026 00:564,374674,581,839634,164,00021,971,00017,235,968
7Apr 22, 2026 00:564,377665,017,873628,731,00027,943,00017,063,936
8Apr 22, 2026 00:564,378665,691,876626,838,00029,992,00017,063,936
9Apr 22, 2026 00:564,384665,933,066632,749,00024,990,00017,113,088