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:06limanjun99limanjun99Score: 4,162Success
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:064,15827,726,3098,316,0002,079,0002,289,664
2Apr 13, 2026 05:064,16227,218,2479,365,0001,040,0002,519,040
3Apr 13, 2026 05:064,16925,250,1458,339,0002,084,0002,289,664