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 22:41olliecrowolliecrowScore: 4,965Success
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 22:414,67527,848,51011,687,00002,387,968
2Apr 17, 2026 22:414,96528,355,89710,344,0002,068,0002,314,240
3Apr 17, 2026 22:415,16442,080,96411,918,000993,0002,363,392