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 01:28olliecrowolliecrowScore: 4,927Success
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 01:284,70430,738,88610,692,0001,069,0002,478,080
2Apr 17, 2026 01:284,92729,250,8659,239,0003,079,0002,486,272
3Apr 17, 2026 01:284,97427,389,95510,364,0002,072,0002,473,984