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 listMay 31, 2025 15:41KeefeKeefeScore: 23,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2025 15:4123,66790,879,03849,140,00010,028,0002,428,928
2May 31, 2025 15:4123,66886,054,57754,157,0005,014,0002,375,680
3May 31, 2025 15:4124,20287,809,04048,404,00012,101,0002,404,352