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 listMar 4, 2026 20:30olliecrowolliecrowScore: 3,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 20:303,710584,574,967525,520,00030,971,00016,969,728
2Mar 4, 2026 20:303,712579,447,510531,775,00024,989,00016,969,728
3Mar 4, 2026 20:303,712583,462,358527,859,00028,992,00017,170,432
4Mar 4, 2026 20:303,713580,809,708525,000,00032,000,00017,055,744
5Mar 4, 2026 20:303,714588,734,899527,033,00030,001,00016,990,208
6Mar 4, 2026 20:303,715583,699,063535,278,00021,970,00016,973,824
7Mar 4, 2026 20:303,718581,398,345527,771,00029,987,00017,108,992
8Mar 4, 2026 20:303,722587,107,279528,223,00030,012,00016,998,400
9Mar 4, 2026 20:303,722587,222,046521,318,00036,951,00016,986,112