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:27AnSaAnSaScore: 1,568,262Success
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:271,566,9613,986,305,3023,917,403,51602,297,856
2Jan 31, 2024 13:271,568,2623,984,176,7433,920,654,40002,297,856
3Jan 31, 2024 13:271,568,6623,990,823,1873,921,654,92602,252,800