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 listJul 29, 2026 17:25anboto1anboto1Score: 2,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 17:262,761424,223,897399,639,00014,542,00016,793,600
2Jul 29, 2026 17:262,763425,692,858399,949,00014,549,00016,793,600
3Jul 29, 2026 17:262,763424,454,584400,095,00014,457,00016,793,600
4Jul 29, 2026 17:262,763424,505,401399,902,00014,552,00016,793,600
5Jul 29, 2026 17:262,765424,772,991400,264,00014,561,00016,793,600
6Jul 29, 2026 17:262,766424,951,402400,391,00014,516,00016,793,600
7Jul 29, 2026 17:262,771425,893,299401,276,00014,493,00016,793,600
8Jul 29, 2026 17:262,772426,504,011401,208,00014,652,00016,793,600
9Jul 29, 2026 17:262,777426,628,386402,120,00014,513,00016,793,600