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 listOct 17, 2026 09:56KacpxerKacpxerScore: 1,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 09:571,59814,808,8962,722,0001,274,0002,121,728
2Oct 17, 2026 09:571,61916,257,9042,757,0001,292,0002,121,728
3Oct 17, 2026 09:571,70015,472,7063,096,0001,154,0002,121,728