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 listMar 15, 2026 03:38Elijah KinElijah KinScore: 23,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 03:3822,77383,257,63753,937,0002,996,0002,314,240
2Mar 15, 2026 03:3823,07285,456,15654,645,0003,035,0002,306,048
3Mar 15, 2026 03:3823,09082,925,98156,713,0001,012,0002,318,336