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 listDec 29, 2024 21:00Joad NacerJoad NacerScore: 105,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 21:00105,081287,016,323257,709,0004,994,0002,535,424
2Dec 29, 2024 21:00105,372291,730,399262,430,0001,001,0002,363,392
3Dec 29, 2024 21:00105,516290,290,400258,794,0004,996,0002,392,064