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 18, 2026 05:11limanjun99limanjun99Score: 3,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 05:113,603563,877,016500,543,00039,963,00016,986,112
2Apr 18, 2026 05:113,611574,597,140504,652,00036,974,00017,018,880
3Apr 18, 2026 05:113,617566,172,368502,627,00039,970,00016,990,208
4Apr 18, 2026 05:113,620568,559,294505,061,00038,004,00016,994,304
5Apr 18, 2026 05:113,623568,570,562503,499,00039,960,00017,055,744
6Apr 18, 2026 05:113,627572,794,502513,117,00031,007,00016,990,208
7Apr 18, 2026 05:113,630570,873,206501,483,00042,955,00017,084,416
8Apr 18, 2026 05:113,640568,260,052508,988,00036,999,00017,051,648
9Apr 18, 2026 05:113,657569,693,428505,579,00042,964,00016,982,016