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 listFeb 16, 2026 23:03Valentin KofmanValentin KofmanScore: 3,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 23:033,847602,789,827567,079,00010,001,00017,027,072
2Feb 16, 2026 23:033,847601,943,423567,114,00010,002,00017,002,496
3Feb 16, 2026 23:033,850604,179,334566,506,00010,990,00017,113,088
4Feb 16, 2026 23:033,850600,983,026566,508,00010,990,00017,035,264
5Feb 16, 2026 23:033,850603,487,246567,515,0009,991,00017,096,704
6Feb 16, 2026 23:033,850607,949,070567,528,0009,991,00017,141,760
7Feb 16, 2026 23:033,851601,225,354569,648,0007,995,00017,125,376
8Feb 16, 2026 23:033,851610,659,860569,665,0007,995,00017,027,072
9Feb 16, 2026 23:033,851608,292,377568,682,0008,994,00017,035,264