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 14, 2026 07:35Victor MerckléVictor MerckléScore: 1,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 07:371,59812,082,6102,902,0001,095,0002,117,632stderr
2Jul 14, 2026 07:371,60112,161,3192,904,0001,100,0002,117,632stderr
3Jul 14, 2026 07:371,61812,173,6672,927,0001,118,0002,117,632stderr
4Jul 14, 2026 07:371,63512,142,8402,958,0001,130,0002,117,632stderr
5Jul 14, 2026 07:371,67812,294,8993,044,0001,151,0002,117,632stderr
6Jul 14, 2026 07:371,70812,925,3543,131,0001,141,0002,117,632stderr
7Jul 14, 2026 07:371,70912,305,2733,130,0001,144,0002,117,632stderr
8Jul 14, 2026 07:371,71212,380,2473,143,0001,138,0002,117,632stderr
9Jul 14, 2026 07:371,71912,948,7583,140,0001,159,0002,117,632stderr