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 27, 2026 17:01Elijah KinElijah KinScore: 11,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2026 17:0210,95337,313,15323,029,0004,354,0002,113,536
2May 27, 2026 17:0210,99637,131,74623,395,0004,095,0002,113,536
3May 27, 2026 17:0211,02536,902,06323,466,0004,098,0002,113,536
4May 27, 2026 17:0211,02639,270,43123,475,0004,092,0002,113,536
5May 27, 2026 17:0211,10339,386,85723,423,0004,335,0002,113,536
6May 27, 2026 17:0211,20641,296,62823,925,0004,091,0002,113,536
7May 27, 2026 17:0211,21138,779,81523,928,0004,101,0002,113,536
8May 27, 2026 17:0211,34138,539,03124,259,0004,095,0002,113,536
9May 27, 2026 17:0211,64238,566,34224,934,0004,171,0002,113,536