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 12, 2026 14:45limanjun99limanjun99Score: 103,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 14:45103,687291,637,657256,216,0003,002,000901,120
2Apr 12, 2026 14:45103,717285,540,618256,290,0003,003,000888,832
3Apr 12, 2026 14:45103,931288,285,902257,829,0001,998,000765,952