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 23, 2025 04:48Josu San MartinJosu San MartinScore: 54,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 04:5554,247163,638,952129,590,0006,027,0002,318,336
2Dec 23, 2025 04:4854,301158,776,312129,764,0005,989,0002,367,488
3Dec 23, 2025 04:5554,431164,841,783127,072,0009,005,0002,375,680
4Dec 23, 2025 04:4854,517163,757,313129,278,0007,015,0002,326,528
5Dec 23, 2025 04:4854,543162,241,845129,339,0007,018,0002,506,752
6Dec 23, 2025 04:4854,566162,356,009130,397,0006,018,0002,465,792
7Dec 23, 2025 04:4854,726161,889,303128,826,0007,989,0002,502,656
8Dec 23, 2025 04:5554,881162,581,659127,189,00010,014,0002,322,432
9Dec 23, 2025 04:4854,926161,062,217129,296,0008,018,0002,527,232
10Dec 23, 2025 04:4854,997163,302,249130,467,0007,025,0002,506,752
11Dec 23, 2025 04:4855,242161,458,341128,099,00010,007,0002,289,664
12Dec 23, 2025 04:4855,730164,520,209134,314,0005,011,0002,367,488