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 13, 2026 11:32limanjun99limanjun99Score: 3,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 11:323,85825,822,6677,503,0002,143,0002,293,760
2Apr 13, 2026 11:323,89231,705,1877,569,0002,162,0002,293,760
3Apr 13, 2026 11:323,90432,149,7648,676,0001,084,0002,273,280