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,455Success
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,31594,451,86861,259,0007,029,0002,326,528
2Dec 29, 2025 16:0427,45590,673,25462,581,0006,056,0002,367,488
3Dec 29, 2025 16:0427,657100,250,52564,132,0005,010,0002,281,472