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 listDec 21, 2023 09:23Oleg KovalovOleg KovalovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2023 09:2300000Error: Exit with code 2: SIGSEGV: segmentation violation PC=0x7fdbb27a8ad1 m=0 sigcode=1 signal arrived during cgo execution goroutine 1 [syscall]: runtime.cgocall(0x557e95dcee30, 0xc00002c730) /tmp/go1.21.5/go/src/runtime/cgocall.go:157 +0x4b fp=0xc...stderr
2Dec 21, 2023 09:3200000Error: Exit with code 2: SIGSEGV: segmentation violation PC=0x55d10aff2d80 m=0 sigcode=1 signal arrived during cgo execution goroutine 1 [syscall]: runtime.cgocall(0x55d10aff2e20, 0xc00002c730) /tmp/go1.21.5/go/src/runtime/cgocall.go:157 +0x4b fp=0xc...stderr