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 30, 2025 05:50Josu San MartinJosu San MartinScore: 61,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 05:5061,862182,124,328148,631,0006,025,0002,531,328
2Dec 30, 2025 05:5061,934185,575,510151,839,0002,996,0002,486,272
3Dec 30, 2025 05:5062,041181,586,468153,101,0002,001,0002,379,776