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 listMay 1, 2026 02:39olliecrowolliecrowScore: 3,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 02:393,166493,070,954470,986,0003,999,00017,117,184
2May 1, 2026 02:393,172496,827,145470,820,0004,998,00017,182,720
3May 1, 2026 02:393,177494,887,212471,570,0004,995,00017,108,992
4May 1, 2026 02:393,179498,266,413471,913,0004,999,00017,027,072
5May 1, 2026 02:393,180494,885,312473,028,0004,000,00017,121,280
6May 1, 2026 02:393,180497,189,971473,117,0004,000,00017,113,088
7May 1, 2026 02:393,180499,234,925472,109,0005,001,00017,104,896
8May 1, 2026 02:393,181495,910,068472,198,0005,002,00017,117,184
9May 1, 2026 02:393,181497,019,815473,256,0004,002,00017,121,280