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 00:11olliecrowolliecrowScore: 90,059Success
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 00:1190,048249,333,564222,119,0003,001,0002,482,176
2Apr 17, 2026 00:1190,059249,722,527223,146,0002,001,0002,478,080
3Apr 17, 2026 00:1190,080250,269,403222,197,0003,002,0002,301,952