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 9, 2026 00:57Victor MerckléVictor MerckléScore: 4,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 01:004,02819,466,6917,278,0002,792,0002,138,112stderr
2Jul 9, 2026 01:004,06419,522,6516,752,0003,410,0002,134,016stderr
3Jul 9, 2026 01:004,07019,611,7127,371,0002,806,0002,134,016stderr
4Jul 9, 2026 01:004,08019,607,9486,788,0003,413,0002,134,016stderr
5Jul 9, 2026 01:004,10319,602,2796,906,0003,353,0002,134,016stderr
6Jul 9, 2026 01:004,10719,699,8286,793,0003,475,0002,142,208stderr
7Jul 9, 2026 01:004,10919,569,3536,726,0003,547,0002,134,016stderr
8Jul 9, 2026 01:004,25620,121,0357,001,0003,639,0002,134,016stderr
9Jul 9, 2026 01:004,27120,104,8577,149,0003,530,0002,191,360stderr