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 30, 2026 11:13Victor MerckléVictor MerckléScore: 2,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 11:152,53114,614,1594,994,0001,334,0002,113,536
2May 30, 2026 11:152,53114,234,8424,994,0001,335,0002,113,536
3May 30, 2026 11:152,53916,118,7615,014,0001,335,0002,113,536
4May 30, 2026 11:152,54614,059,4595,033,0001,333,0002,113,536
5May 30, 2026 11:152,54814,850,7805,034,0001,338,0002,113,536
6May 30, 2026 11:152,60814,333,3714,248,0002,274,0002,113,536
7May 30, 2026 11:152,62716,192,0645,234,0001,334,0002,113,536
8May 30, 2026 11:152,69615,690,1964,452,0002,289,0002,113,536
9May 30, 2026 11:152,70216,753,3324,479,0002,278,0002,113,536