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 listMay 20, 2026 08:12Jacob McDanielJacob McDanielScore: 2,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 08:122,74218,138,3425,674,0001,183,0002,117,632
2May 20, 2026 08:122,74218,094,8835,670,0001,185,0002,117,632
3May 20, 2026 08:122,75516,376,3225,688,0001,201,0002,117,632
4May 20, 2026 08:122,76218,032,1285,707,0001,199,0002,117,632
5May 20, 2026 08:122,80017,061,7805,732,0001,268,0002,117,632
6May 20, 2026 08:122,81118,050,4415,767,0001,262,0002,117,632
7May 20, 2026 08:122,81517,894,7995,766,0001,272,0002,117,632
8May 20, 2026 08:122,82218,067,6505,782,0001,275,0002,117,632
9May 20, 2026 08:122,82517,447,7515,811,0001,253,0002,117,632