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 listSep 27, 2025 07:39Kirill020708Kirill020708Score: 13,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 07:3913,5202,058,903,7151,978,076,00049,875,00017,113,088
2Sep 27, 2025 07:3913,5622,064,165,8871,987,337,00046,889,00017,059,840
3Sep 27, 2025 07:3913,6452,074,954,2321,999,875,00046,879,00017,063,936
4Sep 27, 2025 07:3913,7252,087,690,0222,015,854,00042,890,00017,149,952
5Sep 27, 2025 07:3913,8022,097,899,5452,023,403,00046,893,00017,027,072
6Sep 27, 2025 07:3913,8722,114,650,7372,031,858,00048,876,00017,055,744
7Sep 27, 2025 07:3914,0022,133,744,0032,067,375,00032,926,00017,133,568
8Sep 27, 2025 07:3915,3732,339,127,7452,255,035,00050,887,00017,084,416
9Sep 27, 2025 07:3915,6422,380,021,2522,297,455,00048,882,00017,170,432