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 4, 2024 12:06Andrey LikhachevAndrey LikhachevScore: 219,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2024 12:06219,584608,326,331548,958,84902,211,840
2Jan 4, 2024 12:06219,772627,884,439549,429,63202,285,568
3Jan 4, 2024 12:06219,849612,904,028549,621,26502,215,936