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 listNov 18, 2025 22:01Yuriy LyfenkoYuriy LyfenkoScore: 4,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2025 22:014,02730,525,5368,055,0002,013,0002,338,816
2Nov 18, 2025 22:014,05228,431,8139,118,0001,013,0002,420,736
3Nov 18, 2025 22:014,20228,391,0386,304,0004,202,0002,273,280