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 08:54TudyMTudyMScore: 5,836Success
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 08:555,553848,133,926797,055,00036,002,00017,235,968
2Apr 28, 2026 08:555,575852,526,568798,322,00037,967,00017,076,224
3Apr 28, 2026 08:555,617859,888,646811,639,00030,986,00017,149,952
4Apr 28, 2026 08:555,621860,239,929806,225,00036,964,00017,149,952
5Apr 28, 2026 08:555,836892,257,474840,451,00034,977,00017,141,760
6Apr 28, 2026 08:555,843894,558,278841,501,00034,979,00017,145,856
7Apr 28, 2026 08:555,845894,487,756839,772,00036,989,00017,149,952
8Apr 28, 2026 08:555,899906,562,593850,008,00034,959,00017,145,856
9Apr 28, 2026 08:555,909904,004,774858,502,00027,983,00017,137,664