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 listMar 7, 2025 22:52KeefeKeefeScore: 49,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2025 22:5248,896147,974,363111,220,00011,021,0002,490,368
2Mar 7, 2025 22:5249,313151,528,589112,258,00011,025,0002,473,984
3Mar 7, 2025 22:5249,928152,160,958114,755,00010,066,0002,351,104