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 21:45Victor MerckléVictor MerckléScore: 1,751Success
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 21:501,70412,353,4632,913,0001,348,0002,117,632stderr
2Jul 7, 2026 21:501,70712,293,5663,152,0001,116,0002,117,632stderr
3Jul 7, 2026 21:501,73512,346,7403,220,0001,118,0002,117,632stderr
4Jul 7, 2026 21:501,74212,471,3503,229,0001,127,0002,117,632stderr
5Jul 7, 2026 21:501,75112,372,8963,248,0001,131,0002,117,632stderr
6Jul 7, 2026 21:501,75212,499,3533,139,0001,241,0002,117,632stderr
7Jul 7, 2026 21:501,79812,919,4663,349,0001,148,0002,117,632stderr
8Jul 7, 2026 21:501,80512,710,4093,368,0001,145,0002,117,632stderr
9Jul 7, 2026 21:501,84313,067,6003,501,0001,108,0002,117,632stderr