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 2, 2026 18:56Victor MerckléVictor MerckléScore: 1,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 18:581,57512,291,9962,833,0001,105,0002,117,632stderr
2Aug 2, 2026 18:581,66812,833,6043,021,0001,150,0002,117,632stderr
3Aug 2, 2026 18:581,67413,325,9673,040,0001,146,0002,117,632stderr
4Aug 2, 2026 18:581,67613,128,2773,053,0001,137,0002,117,632stderr
5Aug 2, 2026 18:581,69013,346,3393,074,0001,151,0002,117,632stderr
6Aug 2, 2026 18:581,69513,291,2643,081,0001,157,0002,117,632stderr
7Aug 2, 2026 18:581,69913,396,8213,081,0001,167,0002,117,632stderr
8Aug 2, 2026 18:581,70212,587,9323,098,0001,157,0002,117,632stderr
9Aug 2, 2026 18:581,71613,365,5593,124,0001,166,0002,117,632stderr