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 5, 2026 17:51Victor MerckléVictor MerckléScore: 1,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 17:531,63012,327,2812,932,0001,145,0002,117,632stderr
2Jul 5, 2026 17:531,63212,098,0332,942,0001,138,0002,117,632stderr
3Jul 5, 2026 17:531,63712,118,7502,952,0001,141,0002,117,632stderr
4Jul 5, 2026 17:531,63812,141,8802,952,0001,143,0002,117,632stderr
5Jul 5, 2026 17:531,64912,168,9042,963,0001,160,0002,117,632stderr
6Jul 5, 2026 17:531,64912,129,1102,960,0001,163,0002,117,632stderr
7Jul 5, 2026 17:531,65012,179,8012,947,0001,179,0002,117,632stderr
8Jul 5, 2026 17:531,68013,246,8452,947,0001,255,0002,117,632stderr
9Jul 5, 2026 17:531,70812,269,5783,082,0001,190,0002,117,632stderr