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:56TudyMTudyMScore: 5,508Success
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:565,479840,413,502791,993,00029,999,00017,154,048
2Apr 28, 2026 08:565,492840,242,131795,902,00027,996,00017,145,856
3Apr 28, 2026 08:565,499841,849,052794,873,00029,995,00017,133,568
4Apr 28, 2026 08:565,500842,670,931796,004,00029,000,00017,145,856
5Apr 28, 2026 08:565,508845,040,913799,355,00026,978,00017,002,496
6Apr 28, 2026 08:565,511843,267,994797,665,00028,987,00017,055,744
7Apr 28, 2026 08:565,514850,965,582794,238,00032,968,00017,137,664
8Apr 28, 2026 08:565,516845,020,444796,566,00030,983,00017,145,856
9Apr 28, 2026 08:565,522846,713,155798,346,00029,975,00017,113,088