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:50AnSaAnSaScore: 1,568,319Success
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:501,567,3273,979,718,2143,918,316,59902,289,664
2Jan 31, 2024 13:501,568,3193,979,330,3283,920,798,25102,293,760
3Jan 31, 2024 13:501,568,9923,962,872,1423,922,480,27202,297,856