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 1, 2025 21:49Aniruddha DebAniruddha DebScore: 4,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2025 21:494,419684,670,943660,787,0001,999,00017,203,200
2Apr 1, 2025 21:454,425690,474,622661,731,0001,999,00017,203,200
3Apr 1, 2025 21:454,427689,287,435662,004,0002,000,00017,199,104
4Apr 1, 2025 21:454,428695,190,398662,185,0002,000,00017,203,200
5Apr 1, 2025 21:454,430686,571,164661,524,0002,997,00017,199,104
6Apr 1, 2025 21:454,434692,862,923661,170,0003,994,00017,203,200
7Apr 1, 2025 21:454,436689,427,906663,410,0001,998,00017,121,280
8Apr 1, 2025 21:454,437692,131,644663,581,0001,998,00017,203,200
9Apr 1, 2025 21:494,437690,048,265662,565,0002,998,00017,117,184
10Apr 1, 2025 21:494,443690,345,779663,515,0002,997,00017,108,992
11Apr 1, 2025 21:454,444689,363,326663,657,0002,998,00017,203,200
12Apr 1, 2025 21:454,598714,010,418685,743,0003,998,00017,215,488