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:08Josu San MartinJosu San MartinScore: 27,416Success
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:0827,38996,008,13361,424,0007,048,0002,281,472
2Dec 29, 2025 16:0827,41697,278,02164,509,0004,031,0002,519,040
3Dec 29, 2025 16:0827,72197,067,10760,264,0009,039,0002,490,368