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 listDec 24, 2023 22:01Kenneth MaplesKenneth MaplesScore: 63,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 22:0163,341184,533,733147,328,00011,024,0002,437,120
2Dec 24, 2023 22:0163,356187,758,562145,358,00013,032,0002,465,792
3Dec 24, 2023 22:0163,360180,178,410147,372,00011,027,0002,486,272
4Dec 24, 2023 22:0163,380182,213,113149,424,0009,025,0002,482,176
5Dec 24, 2023 22:0163,397180,242,237149,465,0009,028,0002,473,984
6Dec 24, 2023 22:0163,398183,301,248153,481,0005,015,0002,482,176
7Dec 24, 2023 22:0163,420185,444,639147,511,00011,038,0002,482,176
8Dec 24, 2023 22:0163,455185,822,397151,609,0007,028,0002,482,176
9Dec 24, 2023 22:0163,691185,345,597147,211,00012,017,0002,310,144
10Dec 24, 2023 22:0165,406220,325,463163,515,18702,195,456
11Dec 24, 2023 22:0165,470229,476,806163,675,18802,195,456
12Dec 24, 2023 22:0165,494223,197,256163,735,60802,199,552