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 21, 2026 20:18Yuriy LyfenkoYuriy LyfenkoScore: 3,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:183,72727,712,2358,283,0001,035,0002,510,848
2Mar 21, 2026 20:183,74527,843,4688,322,0001,040,0002,465,792
3Mar 21, 2026 20:183,74925,314,4498,332,0001,041,0002,510,848
4Mar 21, 2026 20:183,75327,084,9218,340,0001,042,0002,469,888
5Mar 21, 2026 20:183,76124,468,5578,359,0001,044,0002,510,848
6Mar 21, 2026 20:183,76627,643,9728,368,0001,046,0002,510,848
7Mar 21, 2026 20:183,78028,145,3537,350,0002,100,0002,502,656
8Mar 21, 2026 20:183,84230,456,4929,605,00002,510,848
9Mar 21, 2026 20:183,85933,467,5458,576,0001,072,0002,457,600