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 listJan 31, 2024 13:28AnSaAnSaScore: 1,573,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2024 13:281,573,3963,995,998,9923,933,489,93602,252,800
2Jan 31, 2024 13:281,573,5204,012,539,2433,933,799,73802,277,376
3Jan 31, 2024 13:281,573,7973,992,197,1573,934,492,49402,273,280