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 listMay 29, 2026 23:07Victor MerckléVictor MerckléScore: 2,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:092,52416,209,7704,982,0001,328,0002,113,536
2May 29, 2026 23:092,52614,087,9364,985,0001,331,0002,113,536
3May 29, 2026 23:092,53215,797,9675,002,0001,329,0002,113,536
4May 29, 2026 23:092,53214,731,6845,003,0001,327,0002,113,536
5May 29, 2026 23:092,53515,037,0265,006,0001,332,0002,113,536
6May 29, 2026 23:092,60815,304,8925,195,0001,326,0002,113,536
7May 29, 2026 23:092,60816,050,9125,194,0001,328,0002,113,536
8May 29, 2026 23:092,62714,302,7765,236,0001,332,0002,113,536
9May 29, 2026 23:092,65215,322,3735,287,0001,345,0002,113,536