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 29, 2025 16:04Josu San MartinJosu San MartinScore: 27,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 16:0427,47992,301,68063,646,0005,051,0002,367,488
2Dec 29, 2025 16:0427,56597,153,92957,926,00010,986,0002,310,144
3Dec 29, 2025 16:0428,91996,039,49965,269,0007,029,0002,453,504