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 listAug 27, 2026 17:41Elijah KinElijah KinScore: 2,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:422,32615,957,9714,319,0001,496,0002,117,632
2Aug 27, 2026 17:422,34015,659,0554,315,0001,536,0002,117,632
3Aug 27, 2026 17:422,64416,746,4915,060,0001,552,0002,117,632
4Aug 27, 2026 17:422,67316,438,9075,140,0001,543,0002,117,632
5Aug 27, 2026 17:422,68016,938,4385,187,0001,513,0002,117,632
6Aug 27, 2026 17:422,73217,054,9715,322,0001,510,0002,117,632
7Aug 27, 2026 17:422,74517,078,1335,269,0001,595,0002,117,632
8Aug 27, 2026 17:422,80818,052,1755,541,0001,481,0002,117,632
9Aug 27, 2026 17:422,85216,923,0415,412,0001,719,0002,117,632