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:58AnSaAnSaScore: 1,568,869Success
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:581,567,0313,984,071,1493,917,578,35302,301,952
2Jan 31, 2024 13:581,568,8693,978,913,3513,922,172,47502,256,896
3Jan 31, 2024 13:581,569,0443,980,540,5133,922,611,23402,293,760