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 10:42Victor MerckléVictor MerckléScore: 1,754Success
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 10:561,72312,712,4853,217,0001,091,0002,117,632stderr
2Aug 29, 2026 10:561,72312,721,1073,204,0001,105,0002,117,632stderr
3Aug 29, 2026 10:561,74414,060,8043,251,0001,111,0002,117,632stderr
4Aug 29, 2026 10:561,75212,748,2713,135,0001,247,0002,117,632stderr
5Aug 29, 2026 10:561,75412,767,0063,291,0001,096,0002,117,632stderr
6Aug 29, 2026 10:561,81214,255,1603,395,0001,135,0002,117,632stderr
7Aug 29, 2026 10:561,82512,996,9263,405,0001,159,0002,117,632stderr
8Aug 29, 2026 10:561,86013,079,7133,518,0001,132,0002,117,632stderr
9Aug 29, 2026 10:561,94313,342,3163,779,0001,079,0002,117,632stderr