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 listMar 15, 2026 01:31Elijah KinElijah KinScore: 17,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 01:3117,73870,142,59442,331,0002,015,0002,506,752
2Mar 15, 2026 01:3117,79069,588,80742,453,0002,021,0002,260,992
3Mar 15, 2026 01:3117,83668,686,09542,565,0002,026,0002,301,952
4Mar 15, 2026 01:3117,84473,004,43143,598,0001,013,0002,306,048
5Mar 15, 2026 01:3117,89772,000,05640,676,0004,067,0002,514,944
6Mar 15, 2026 01:3117,94070,908,72639,868,0004,983,0002,297,856
7Mar 15, 2026 01:3117,98974,074,10741,974,0002,998,0002,306,048
8Mar 15, 2026 01:3118,06672,478,59042,154,0003,011,0002,306,048
9Mar 15, 2026 01:3118,35271,170,26743,886,0001,994,0002,265,088