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 22:34Elijah KinElijah KinScore: 2,701Success
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 22:352,35915,625,0524,365,0001,533,0002,117,632
2Aug 27, 2026 22:352,44115,895,1934,472,0001,632,0002,117,632
3Aug 27, 2026 22:352,52216,424,5894,797,0001,508,0002,117,632
4Aug 27, 2026 22:352,54216,561,5504,802,0001,554,0002,117,632
5Aug 27, 2026 22:352,70116,985,6885,235,0001,518,0002,117,632
6Aug 27, 2026 22:352,74017,106,0005,331,0001,520,0002,117,632
7Aug 27, 2026 22:352,75017,119,1644,760,0002,115,0002,117,632
8Aug 27, 2026 22:352,80718,502,9535,492,0001,526,0002,117,632
9Aug 27, 2026 22:352,95318,367,6525,537,0001,846,0002,117,632