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 listApr 27, 2026 05:18olliecrowolliecrowScore: 4,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:224,03225,628,8627,057,0003,024,0002,547,712
2Apr 27, 2026 05:224,03724,799,9507,065,0003,028,0002,543,616
3Apr 27, 2026 05:224,09326,291,1217,164,0003,070,0002,539,520
4Apr 27, 2026 05:224,15626,459,4717,273,0003,117,0002,359,296
5Apr 27, 2026 05:224,16625,736,0047,291,0003,124,0002,363,392
6Apr 27, 2026 05:224,30128,217,6999,679,0001,075,0002,355,200
7Apr 27, 2026 05:224,34231,439,4426,908,0003,947,0002,535,424
8Apr 27, 2026 05:224,40935,735,7658,017,0003,006,0002,547,712
9Apr 27, 2026 05:224,42829,459,3907,046,0004,026,0002,363,392