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 09:24A_ShamanA_ShamanScore: 16,042Success
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 09:2415,45848,116,82635,271,0003,374,0002,113,536
2Jul 2, 2026 09:2415,46348,062,94735,352,0003,307,0002,113,536
3Jul 2, 2026 09:2415,75048,813,49136,033,0003,342,0002,113,536
4Jul 2, 2026 09:2415,81049,012,86636,237,0003,290,0002,113,536
5Jul 2, 2026 09:2416,04250,821,23536,771,0003,335,0002,113,536
6Jul 2, 2026 09:2416,10149,739,43736,846,0003,408,0002,113,536
7Jul 2, 2026 09:2416,13149,826,62636,937,0003,391,0002,113,536
8Jul 2, 2026 09:2416,24750,086,55036,259,0004,360,0002,113,536
9Jul 2, 2026 09:2416,27050,168,91636,202,0004,475,0002,113,536