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 13, 2026 09:06Victor MerckléVictor MerckléScore: 114,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 09:06114,583298,328,194283,435,0003,023,0002,125,824stderr
2May 13, 2026 09:06114,586298,513,505283,422,0003,044,0002,125,824stderr
3May 13, 2026 09:06114,592296,944,930283,425,0003,055,0002,125,824stderr
4May 13, 2026 09:06114,651298,502,963283,533,0003,096,0002,125,824stderr
5May 13, 2026 09:06114,669295,972,882283,635,0003,039,0002,125,824stderr
6May 13, 2026 09:06114,715298,651,805283,686,0003,102,0002,125,824stderr
7May 13, 2026 09:06115,283297,722,496285,147,0003,062,0002,125,824stderr
8May 13, 2026 09:06115,311297,966,661285,205,0003,074,0002,125,824stderr
9May 13, 2026 09:06115,849300,798,657286,558,0003,065,0002,125,824stderr