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:42TudyMTudyMScore: 5,597Success
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:435,562849,764,755799,472,00034,976,00017,149,952
2Apr 28, 2026 08:435,568852,628,109806,294,00028,974,00017,072,128
3Apr 28, 2026 08:435,575854,791,484799,347,00036,969,00017,141,760
4Apr 28, 2026 08:435,589857,079,483798,491,00039,974,00017,149,952
5Apr 28, 2026 08:435,597857,410,473809,672,00029,987,00017,203,200
6Apr 28, 2026 08:435,600863,438,704805,124,00035,005,00016,977,920
7Apr 28, 2026 08:435,604862,532,061811,669,00028,988,00017,141,760
8Apr 28, 2026 08:435,608859,067,401808,301,00032,971,00017,141,760
9Apr 28, 2026 08:435,923908,318,492858,508,00029,982,00017,031,168