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 listSep 15, 2026 08:38Victor MerckléVictor MerckléScore: 1,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 08:391,34712,163,4441,836,0001,533,0002,117,632stderr
2Sep 15, 2026 08:391,37412,157,1551,876,0001,561,0002,117,632stderr
3Sep 15, 2026 08:391,42912,131,3502,324,0001,250,0002,117,632stderr
4Sep 15, 2026 08:391,44413,083,0292,081,0001,531,0002,117,632stderr
5Sep 15, 2026 08:391,47013,091,3612,110,0001,566,0002,117,632stderr
6Sep 15, 2026 08:391,47412,355,1042,097,0001,589,0002,117,632stderr
7Sep 15, 2026 08:391,48212,441,9942,132,0001,575,0002,117,632stderr
8Sep 15, 2026 08:391,48312,497,0322,155,0001,554,0002,117,632stderr
9Sep 15, 2026 08:391,49712,641,2742,145,0001,599,0002,117,632stderr