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 12:39Victor MerckléVictor MerckléScore: 1,673Success
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 12:441,61212,329,1572,908,0001,122,0002,117,632stderr
2Aug 29, 2026 12:441,65212,398,8002,991,0001,140,0002,117,632stderr
3Aug 29, 2026 12:441,66412,524,2723,036,0001,124,0002,117,632stderr
4Aug 29, 2026 12:441,66512,587,1223,021,0001,142,0002,117,632stderr
5Aug 29, 2026 12:441,67312,879,6703,044,0001,140,0002,117,632stderr
6Aug 29, 2026 12:441,67612,530,0143,060,0001,130,0002,117,632stderr
7Aug 29, 2026 12:441,68012,719,9793,054,0001,148,0002,117,632stderr
8Aug 29, 2026 12:441,68613,339,3203,067,0001,150,0002,117,632stderr
9Aug 29, 2026 12:441,69013,182,7003,057,0001,170,0002,117,632stderr