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 listApr 28, 2026 09:06TudyMTudyMScore: 5,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:075,469841,395,463792,402,00027,978,00017,149,952
2Apr 28, 2026 09:075,471841,289,988791,687,00028,988,00017,145,856
3Apr 28, 2026 09:075,481841,932,500789,282,00032,970,00017,186,816
4Apr 28, 2026 09:075,483844,961,319790,508,00031,980,00017,145,856
5Apr 28, 2026 09:075,483836,566,933794,519,00027,983,00017,006,592
6Apr 28, 2026 09:075,490844,208,623797,650,00025,988,00017,141,760
7Apr 28, 2026 09:075,525845,382,873799,809,00028,993,00017,219,584
8Apr 28, 2026 09:075,525849,921,801799,895,00028,996,00017,149,952
9Apr 28, 2026 09:075,674871,492,060820,160,00030,968,00017,145,856