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 4, 2026 18:34olliecrowolliecrowScore: 18,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 18:3418,34871,980,71539,887,0005,983,0002,392,064
2Mar 4, 2026 18:3418,36866,870,67141,927,0003,993,0002,306,048
3Mar 4, 2026 18:3418,38569,480,93340,967,0004,996,0002,408,448
4Mar 4, 2026 18:3418,41569,590,72241,034,0005,004,0002,392,064
5Mar 4, 2026 18:3418,42466,691,35642,055,0004,005,0002,510,848
6Mar 4, 2026 18:3418,44167,804,20141,091,0005,011,0002,404,352
7Mar 4, 2026 18:3418,44372,840,37441,097,0005,011,0002,314,240
8Mar 4, 2026 18:3418,49270,145,62541,205,0005,025,0002,400,256
9Mar 4, 2026 18:3418,62271,934,42541,496,0005,060,0002,494,464