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 22, 2026 14:00BenBenScore: 28,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 14:0027,64189,479,88360,091,0009,013,0002,371,584
2Apr 22, 2026 14:0027,71484,728,67858,242,00011,045,0002,535,424
3Apr 22, 2026 14:0027,90289,586,04858,795,00010,961,0002,310,144
4Apr 22, 2026 14:0028,01089,716,38858,021,00012,004,0002,396,160
5Apr 22, 2026 14:0028,17691,324,33963,397,0007,044,0002,543,616
6Apr 22, 2026 14:0028,74686,970,98661,884,0009,981,0002,400,256
7Apr 22, 2026 14:0028,81389,949,27963,029,0009,004,0002,539,520
8Apr 22, 2026 14:0029,00888,169,52164,464,0008,058,0002,543,616
9Apr 22, 2026 14:0029,18387,871,10062,965,0009,994,0002,535,424