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:39TudyMTudyMScore: 5,927Success
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:395,855894,295,725843,398,00034,975,00017,149,952
2Apr 28, 2026 08:395,869902,363,069844,408,00035,974,00017,154,048
3Apr 28, 2026 08:395,874899,597,038842,150,00038,960,00017,154,048
4Apr 28, 2026 08:395,895905,729,379847,410,00036,974,00017,145,856
5Apr 28, 2026 08:395,927904,545,274858,051,00031,001,00017,141,760
6Apr 28, 2026 08:395,946912,971,236858,919,00032,996,00017,137,664
7Apr 28, 2026 08:395,953912,490,427860,070,00033,002,00016,994,304
8Apr 28, 2026 08:396,043924,267,742877,590,00028,986,00017,149,952
9Apr 28, 2026 08:396,124939,895,516877,619,00040,982,00017,141,760