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 listNov 21, 2023 11:23Franek KortaFranek KortaScore: 1,573,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2023 11:231,573,5653,992,966,4283,933,911,36302,260,992
2Nov 21, 2023 11:231,573,6744,009,974,5263,934,185,49202,203,648
3Nov 21, 2023 11:231,575,0884,001,999,5023,937,720,65202,195,456