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:51A_ShamanA_ShamanScore: 13,517Success
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:5113,37742,945,04428,210,0005,234,0002,113,536
2Jul 2, 2026 09:5113,41642,977,02128,517,0005,025,0002,113,536
3Jul 2, 2026 09:5113,43943,077,77328,235,0005,363,0002,113,536
4Jul 2, 2026 09:5113,50443,238,32828,507,0005,254,0002,113,536
5Jul 2, 2026 09:5113,51743,562,88228,765,0005,028,0002,113,536
6Jul 2, 2026 09:5113,54743,198,43728,870,0004,998,0002,113,536
7Jul 2, 2026 09:5113,56443,382,89428,679,0005,232,0002,113,536
8Jul 2, 2026 09:5113,63043,927,75728,801,0005,276,0002,113,536
9Jul 2, 2026 09:5113,80643,983,34729,360,0005,157,0002,113,536