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 listFeb 3, 2025 08:57Andrey LikhachevAndrey LikhachevScore: 46,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 08:5746,903141,327,015117,257,0000872,448
2Feb 3, 2025 08:5746,907143,505,950117,268,0000774,144
3Feb 3, 2025 08:5746,916145,084,572117,289,0000770,048