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 07:38limanjun99limanjun99Score: 4,367Success
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 07:384,36128,993,6866,938,0003,964,0002,510,848
2Apr 13, 2026 07:384,36726,670,4027,940,0002,977,0002,293,760
3Apr 13, 2026 07:384,39729,228,6417,995,0002,998,0002,293,760