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:45TudyMTudyMScore: 6,113Success
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:466,064929,033,409880,681,00028,989,00017,149,952
2Apr 28, 2026 08:466,068930,494,751881,296,00028,976,00017,039,360
3Apr 28, 2026 08:466,095934,769,351884,312,00029,976,00017,145,856
4Apr 28, 2026 08:466,098934,141,815878,716,00035,988,00017,149,952
5Apr 28, 2026 08:466,113934,595,021884,027,00033,001,00017,133,568
6Apr 28, 2026 08:466,318969,771,408912,737,00034,989,00017,002,496
7Apr 28, 2026 08:466,322966,282,626905,424,00042,972,00017,141,760
8Apr 28, 2026 08:466,347969,544,967917,226,00034,970,00017,178,624
9Apr 28, 2026 08:466,367974,922,085920,121,00034,966,00017,154,048