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 13, 2026 11:41Dominique GarmierDominique GarmierScore: 1,138,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 11:411,136,8892,871,537,8572,840,224,0001,998,0002,269,184
2Mar 13, 2026 11:411,136,9492,875,889,5462,842,372,00002,273,280
3Mar 13, 2026 11:411,137,3532,869,750,8542,841,384,0001,998,0002,273,280
4Mar 13, 2026 11:411,137,8232,865,777,3932,843,559,000999,0002,457,600
5Mar 13, 2026 11:411,138,1912,873,381,5922,844,478,000999,0002,273,280
6Mar 13, 2026 11:411,138,6612,888,263,2852,846,653,00002,269,184
7Mar 13, 2026 11:411,138,8892,870,482,8392,845,224,0001,998,0002,273,280
8Mar 13, 2026 11:411,141,7382,878,065,6272,850,347,0003,997,0002,449,408
9Mar 13, 2026 11:411,141,8342,879,352,4042,852,585,0001,999,0002,457,600