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 17, 2026 00:58Valentin KofmanValentin KofmanScore: 4,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 00:584,545705,253,583662,712,00018,991,00016,998,400
2Feb 17, 2026 00:584,549708,426,415670,295,00011,987,00017,027,072
3Feb 17, 2026 00:584,925762,838,679720,723,00017,993,00016,994,304