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 listMar 5, 2026 05:32DanielDanielScore: 4,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 05:324,320675,388,304631,003,00016,973,00017,215,488
2Mar 5, 2026 05:324,325679,014,180635,725,00012,973,00016,973,824
3Mar 5, 2026 05:324,330682,174,444630,487,00018,984,00017,207,296
4Mar 5, 2026 05:324,331682,128,561634,699,00014,969,00017,211,392
5Mar 5, 2026 05:324,332682,870,343635,793,00013,973,00017,043,456
6Mar 5, 2026 05:324,332678,235,993626,872,00022,958,00017,043,456
7Mar 5, 2026 05:324,341678,235,067631,168,00019,973,00017,121,280
8Mar 5, 2026 05:324,347676,018,496637,137,00014,979,00017,207,296
9Mar 5, 2026 05:324,709732,812,346689,336,00016,983,00017,133,568