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:20Victor MerckléVictor MerckléScore: 2,095Success
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:221,96813,011,3342,733,0002,189,0002,125,824stderr
2Jul 14, 2026 07:221,98413,172,1562,849,0002,113,0002,125,824stderr
3Jul 14, 2026 07:222,03113,202,8132,877,0002,201,0002,125,824stderr
4Jul 14, 2026 07:222,06913,164,7433,018,0002,156,0002,125,824stderr
5Jul 14, 2026 07:222,09513,364,7623,030,0002,208,0002,125,824stderr
6Jul 14, 2026 07:222,10413,366,4692,659,0002,602,0002,125,824stderr
7Jul 14, 2026 07:222,12714,016,3243,174,0002,145,0002,125,824stderr
8Jul 14, 2026 07:222,16513,979,0613,210,0002,204,0002,125,824stderr
9Jul 14, 2026 07:222,19714,132,4343,213,0002,280,0002,125,824stderr