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 listJun 14, 2026 00:32Victor MerckléVictor MerckléScore: 6,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 00:335,66723,288,09010,919,0003,249,0002,117,632
2Jun 14, 2026 00:335,72623,467,15811,067,0003,249,0002,117,632
3Jun 14, 2026 00:336,03124,217,75111,814,0003,264,0002,117,632
4Jun 14, 2026 00:336,07524,339,40911,863,0003,326,0002,117,632
5Jun 14, 2026 00:336,11024,426,84711,984,0003,291,0002,117,632
6Jun 14, 2026 00:336,11424,434,90312,024,0003,263,0002,117,632
7Jun 14, 2026 00:336,11524,444,87612,060,0003,229,0002,117,632
8Jun 14, 2026 00:336,22024,739,82112,259,0003,292,0002,117,632
9Jun 14, 2026 00:336,30424,877,42112,405,0003,357,0002,117,632