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 19, 2026 03:28olliecrowolliecrowScore: 5,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 03:285,01228,794,2146,265,0006,265,0002,318,336
2Apr 19, 2026 03:285,05734,132,32710,535,0002,107,0002,318,336
3Apr 19, 2026 03:285,29636,042,4759,167,0004,074,0002,273,280