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 05:13limanjun99limanjun99Score: 4,198Success
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 05:134,13926,447,2278,279,0002,069,0002,510,848
2Apr 13, 2026 05:134,19825,872,3748,396,0002,099,0002,289,664
3Apr 13, 2026 05:134,25228,552,0108,504,0002,126,0002,289,664