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 listAug 29, 2026 09:03Victor MerckléVictor MerckléScore: 1,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 09:061,66612,536,7253,065,0001,101,0002,117,632stderr
2Aug 29, 2026 09:061,66912,531,2453,070,0001,104,0002,117,632stderr
3Aug 29, 2026 09:061,67012,594,5983,070,0001,106,0002,117,632stderr
4Aug 29, 2026 09:061,67012,556,4333,067,0001,108,0002,117,632stderr
5Aug 29, 2026 09:061,67012,654,6073,064,0001,111,0002,117,632stderr
6Aug 29, 2026 09:061,67012,618,0023,070,0001,107,0002,117,632stderr
7Aug 29, 2026 09:061,70312,588,5263,116,0001,143,0002,117,632stderr
8Aug 29, 2026 09:061,72612,752,8323,055,0001,262,0002,117,632stderr
9Aug 29, 2026 09:061,72812,791,6213,184,0001,136,0002,117,632stderr