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:39A_ShamanA_ShamanScore: 13,153Success
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:3912,96041,830,27027,205,0005,197,0002,113,536
2Jul 2, 2026 09:3913,01042,013,49427,308,0005,218,0002,113,536
3Jul 2, 2026 09:3913,10342,237,35527,504,0005,255,0002,113,536
4Jul 2, 2026 09:3913,11242,284,96327,598,0005,183,0002,113,536
5Jul 2, 2026 09:3913,15342,282,74027,875,0005,008,0002,113,536
6Jul 2, 2026 09:3913,23742,737,86827,462,0005,632,0002,113,536
7Jul 2, 2026 09:3913,36342,905,79528,484,0004,925,0002,113,536
8Jul 2, 2026 09:3913,83945,402,84929,345,0005,254,0002,113,536
9Jul 2, 2026 09:3913,92044,295,80229,533,0005,267,0002,113,536