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 00:42Elijah KinElijah KinScore: 36,092Success
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 00:4235,800113,206,16986,484,0003,016,0002,314,240
2Mar 15, 2026 00:4235,808111,309,25685,498,0004,023,0002,527,232
3Mar 15, 2026 00:4235,862114,503,88786,632,0003,022,0002,306,048
4Mar 15, 2026 00:4235,890114,626,96085,693,0004,032,0002,527,232
5Mar 15, 2026 00:4236,092118,012,83988,225,0002,005,0002,314,240
6Mar 15, 2026 00:4236,109115,498,40687,264,0003,009,0002,318,336
7Mar 15, 2026 00:4236,144119,333,00286,345,0004,016,0002,310,144
8Mar 15, 2026 00:4236,166115,383,47287,403,0003,013,0002,310,144
9Mar 15, 2026 00:4236,182114,580,29289,449,0001,005,0002,310,144