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 listApr 28, 2026 08:57TudyMTudyMScore: 19,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:5719,51867,767,51043,816,0004,979,0002,342,912
2Apr 28, 2026 08:5719,57766,782,96842,950,0005,993,0002,359,296
3Apr 28, 2026 08:5719,58866,293,61844,973,0003,997,0002,355,200
4Apr 28, 2026 08:5719,61468,298,98844,033,0005,003,0002,367,488
5Apr 28, 2026 08:5719,68871,155,19043,195,0006,027,0002,359,296
6Apr 28, 2026 08:5719,89963,459,48144,774,0004,974,0002,338,816
7Apr 28, 2026 08:5720,06567,410,62844,144,0006,019,0002,355,200
8Apr 28, 2026 08:5720,09469,112,75743,204,0007,033,0002,355,200
9Apr 28, 2026 08:5721,53771,708,94149,856,0003,988,0002,420,736