Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listMay 26, 2026 17:02Elijah KinElijah KinScore: 11,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2026 17:0210,52436,209,53722,009,0004,301,0002,113,536
2May 26, 2026 17:0210,58536,374,52321,934,0004,530,0002,113,536
3May 26, 2026 17:0210,60936,101,74622,084,0004,439,0002,113,536
4May 26, 2026 17:0210,91039,944,92822,855,0004,420,0002,113,536
5May 26, 2026 17:0211,06139,167,73623,233,0004,421,0002,113,536
6May 26, 2026 17:0211,30937,661,69823,819,0004,454,0002,113,536
7May 26, 2026 17:0211,33641,524,22023,839,0004,502,0002,113,536
8May 26, 2026 17:0211,36838,359,45723,935,0004,485,0002,113,536
9May 26, 2026 17:0211,60539,742,83623,523,0005,491,0002,113,536