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:10Josu San MartinJosu San MartinScore: 27,547Success
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:1027,38091,804,69562,411,0006,039,0002,301,952
2Dec 29, 2025 16:1027,54796,446,06360,884,0007,984,0002,510,848
3Dec 29, 2025 16:1027,679100,024,18562,178,0007,020,0002,514,944