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 listMay 17, 2026 02:55M-RochatM-RochatScore: 4,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:564,258650,934,079617,217,00021,583,00016,793,600
2May 17, 2026 02:564,262648,356,249617,822,00021,603,00016,793,600
3May 17, 2026 02:564,262651,139,692616,449,00022,954,00016,793,600
4May 17, 2026 02:564,263649,278,657618,175,00021,395,00016,793,600
5May 17, 2026 02:564,265651,968,577617,646,00022,220,00016,793,600
6May 17, 2026 02:564,272649,730,376619,556,00021,316,00016,793,600
7May 17, 2026 02:564,276653,558,448619,354,00022,095,00016,793,600
8May 17, 2026 02:564,278653,779,755618,203,00023,554,00016,793,600
9May 17, 2026 02:564,279652,165,802620,480,00021,464,00016,793,600