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 15:16Victor MerckléVictor MerckléScore: 1,586Success
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 15:171,54712,288,8252,810,0001,059,0002,117,632stderr
2Aug 29, 2026 15:171,57812,314,5282,874,0001,072,0002,117,632stderr
3Aug 29, 2026 15:171,58012,158,3902,858,0001,094,0002,117,632stderr
4Aug 29, 2026 15:171,58212,155,7162,863,0001,092,0002,117,632stderr
5Aug 29, 2026 15:171,58612,120,8972,876,0001,089,0002,117,632stderr
6Aug 29, 2026 15:171,64912,470,9932,998,0001,125,0002,117,632stderr
7Aug 29, 2026 15:171,67313,165,4423,068,0001,115,0002,117,632stderr
8Aug 29, 2026 15:171,67312,647,2963,060,0001,124,0002,117,632stderr
9Aug 29, 2026 15:171,71512,578,6143,144,0001,144,0002,117,632stderr