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 3, 2026 15:21Elijah KinElijah KinScore: 4,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 15:234,05219,363,0617,687,0002,444,0002,117,632
2Jun 3, 2026 15:234,06419,210,2007,711,0002,450,0002,117,632
3Jun 3, 2026 15:234,08819,288,8797,707,0002,513,0002,113,536
4Jun 3, 2026 15:234,27719,751,0038,178,0002,516,0002,113,536
5Jun 3, 2026 15:234,36219,898,0778,399,0002,507,0002,113,536
6Jun 3, 2026 15:234,38220,393,3378,485,0002,472,0002,117,632
7Jun 3, 2026 15:234,42020,419,5938,584,0002,466,0002,113,536
8Jun 3, 2026 15:234,61420,586,1269,017,0002,520,0002,113,536
9Jun 3, 2026 15:234,69621,248,6549,254,0002,486,0002,113,536