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 listJul 17, 2023 08:35matsuoka-601matsuoka-601Score: 1,651,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2023 08:351,651,4574,185,689,1634,128,642,11002,183,168
2Jul 17, 2023 08:351,651,6264,180,091,2044,129,064,46902,187,264
3Jul 17, 2023 08:351,652,0394,202,021,2044,130,097,22802,183,168