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 21:34olliecrowolliecrowScore: 3,589Success
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 21:343,585562,270,659526,731,00010,994,00017,084,416
2Mar 4, 2026 21:343,586566,797,595527,892,0009,997,00016,977,920
3Mar 4, 2026 21:343,587563,259,215527,032,00011,000,00017,039,360
4Mar 4, 2026 21:343,587567,763,271527,033,00011,000,00016,977,920
5Mar 4, 2026 21:343,589567,343,326525,279,00013,006,00017,051,648
6Mar 4, 2026 21:343,590567,089,627526,477,00011,988,00016,982,016
7Mar 4, 2026 21:343,590567,117,077523,486,00014,985,00017,178,624
8Mar 4, 2026 21:343,590566,859,507524,563,00013,988,00016,998,400
9Mar 4, 2026 21:343,598566,371,150528,767,00010,995,00016,990,208