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 13, 2026 21:28Victor MerckléVictor MerckléScore: 6,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 21:306,84326,250,53213,873,0003,236,0002,117,632
2Jun 13, 2026 21:306,87526,227,06813,946,0003,242,0002,117,632
3Jun 13, 2026 21:306,89826,420,62514,021,0003,224,0002,117,632
4Jun 13, 2026 21:306,91526,485,06714,041,0003,248,0002,117,632
5Jun 13, 2026 21:306,93626,512,78814,091,0003,250,0002,117,632
6Jun 13, 2026 21:307,09826,969,96514,535,0003,212,0002,117,632
7Jun 13, 2026 21:307,20927,214,04814,795,0003,229,0002,117,632
8Jun 13, 2026 21:307,21027,178,03514,795,0003,230,0002,117,632
9Jun 13, 2026 21:307,28027,339,17814,966,0003,235,0002,117,632