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 listJul 7, 2026 22:48Victor MerckléVictor MerckléScore: 1,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 22:501,62011,954,4712,881,0001,170,0002,117,632stderr
2Jul 7, 2026 22:501,62312,072,9842,886,0001,172,0002,117,632stderr
3Jul 7, 2026 22:501,62812,104,9882,891,0001,181,0002,117,632stderr
4Jul 7, 2026 22:501,63212,117,8772,902,0001,179,0002,117,632stderr
5Jul 7, 2026 22:501,63412,164,8712,901,0001,185,0002,117,632stderr
6Jul 7, 2026 22:501,65912,065,5212,966,0001,182,0002,117,632stderr
7Jul 7, 2026 22:501,66112,185,8452,973,0001,181,0002,117,632stderr
8Jul 7, 2026 22:501,66912,217,1012,974,0001,200,0002,117,632stderr
9Jul 7, 2026 22:501,67412,248,2913,051,0001,135,0002,117,632stderr