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 listDec 31, 2025 23:58Josu San MartinJosu San MartinScore: 13,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 23:5812,7251,942,012,8021,869,873,00038,914,00017,195,008
2Dec 31, 2025 23:5812,7991,956,626,3811,881,962,00037,898,00017,035,264
3Dec 31, 2025 23:5812,8341,957,831,3991,886,268,00038,902,00017,002,496
4Dec 31, 2025 23:5812,9311,968,658,0501,905,764,00033,924,00017,055,744
5Dec 31, 2025 23:5813,0391,986,927,7291,920,890,00034,907,00017,174,528
6Dec 31, 2025 23:5813,0821,998,378,9651,924,430,00037,909,00017,190,912
7Dec 31, 2025 23:5813,5842,071,032,5741,996,774,00040,892,00017,022,976
8Dec 31, 2025 23:5813,7872,099,340,5782,032,090,00035,930,00016,969,728
9Dec 31, 2025 23:5814,4442,198,368,7812,122,700,00043,890,00017,158,144