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:09Josu San MartinJosu San MartinScore: 27,467Success
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:0927,31099,728,50359,239,0009,036,0002,514,944
2Dec 29, 2025 16:0927,46797,320,50262,609,0006,058,0002,514,944
3Dec 29, 2025 16:0927,59795,707,97060,993,0007,999,0002,510,848