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 listApr 17, 2026 02:38olliecrowolliecrowScore: 4,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 02:384,46527,273,4519,134,0002,029,0002,449,408
2Apr 17, 2026 02:384,76631,416,0169,929,0001,985,0002,478,080
3Apr 17, 2026 02:384,84128,331,16211,095,0001,008,0002,367,488