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 10, 2026 05:05olliecrowolliecrowScore: 11,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 05:0511,23457,299,74526,080,0002,006,0002,449,408
2Mar 10, 2026 05:0511,24056,623,13825,090,0003,010,0002,347,008
3Mar 10, 2026 05:0511,25549,780,80125,124,0003,014,0002,314,240
4Mar 10, 2026 05:0511,26257,506,89423,127,0005,027,0002,494,464
5Mar 10, 2026 05:0511,26253,837,10525,138,0003,016,0002,338,816
6Mar 10, 2026 05:0511,27950,385,11524,170,0004,028,0002,330,624
7Mar 10, 2026 05:0511,29756,504,67224,208,0004,034,0002,314,240
8Mar 10, 2026 05:0511,30249,038,94824,218,0004,036,0002,326,528
9Mar 10, 2026 05:0511,31752,923,35826,272,0002,020,0002,314,240