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:37TudyMTudyMScore: 6,161Success
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:386,136937,150,841883,475,00036,936,00017,149,952
2Apr 28, 2026 08:386,142941,236,488885,361,00035,974,00017,141,760
3Apr 28, 2026 08:386,155943,355,176882,462,00040,928,00017,149,952
4Apr 28, 2026 08:386,160944,259,190887,172,00036,965,00017,031,168
5Apr 28, 2026 08:386,161945,234,260883,294,00040,967,00017,154,048
6Apr 28, 2026 08:386,170947,438,420891,663,00033,949,00017,133,568
7Apr 28, 2026 08:386,170948,145,369885,655,00039,939,00017,055,744
8Apr 28, 2026 08:386,356971,187,353920,437,00032,979,00017,235,968
9Apr 28, 2026 08:386,372974,752,769911,886,00043,946,00017,141,760