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 listJul 2, 2026 10:02A_ShamanA_ShamanScore: 12,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:0212,91241,756,00527,117,0005,165,0002,113,536
2Jul 2, 2026 10:0212,94341,766,68227,092,0005,267,0002,113,536
3Jul 2, 2026 10:0212,95441,926,70027,109,0005,276,0002,113,536
4Jul 2, 2026 10:0212,96541,854,59427,227,0005,187,0002,113,536
5Jul 2, 2026 10:0212,99241,974,60327,262,0005,219,0002,113,536
6Jul 2, 2026 10:0213,12842,355,93127,613,0005,209,0002,113,536
7Jul 2, 2026 10:0213,14442,362,68127,551,0005,311,0002,113,536
8Jul 2, 2026 10:0213,45843,144,83928,440,0005,207,0002,113,536
9Jul 2, 2026 10:0213,46043,176,21028,434,0005,216,0002,113,536