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 listMay 1, 2026 13:30Victor MerckléVictor MerckléScore: 4,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 13:314,16428,369,0714,164,0006,246,0002,359,296
2May 1, 2026 13:314,18924,061,0296,284,0004,189,0002,347,008
3May 1, 2026 13:314,20231,371,5106,303,0004,202,0002,347,008
4May 1, 2026 13:314,23027,711,7796,346,0004,230,0002,359,296
5May 1, 2026 13:314,29729,865,9296,446,0004,297,0002,347,008
6May 1, 2026 13:314,45428,700,3127,086,0004,049,0002,355,200
7May 1, 2026 13:314,45829,374,2075,066,0006,079,0002,342,912
8May 1, 2026 13:314,47927,599,5238,145,0003,054,0002,347,008
9May 1, 2026 13:314,50624,000,5908,194,0003,072,0002,342,912