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:19olliecrowolliecrowScore: 5,452Success
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:195,34629,488,57110,280,0003,084,0002,355,200
2Apr 17, 2026 02:195,45230,635,54012,582,0001,048,0002,359,296
3Apr 17, 2026 02:195,48934,618,68711,611,0002,111,0002,392,064