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 listFeb 7, 2026 20:45T PrathamT PrathamScore: 10,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 20:4510,41951,051,63724,045,0002,003,0002,277,376
2Feb 7, 2026 20:4510,44653,681,26725,112,0001,004,0002,310,144
3Feb 7, 2026 20:4510,47147,402,84322,150,0004,027,0002,400,256
4Feb 7, 2026 20:4510,55857,886,26921,319,0005,075,0002,355,200
5Feb 7, 2026 20:4510,59249,939,64424,443,0002,036,0002,486,272
6Feb 7, 2026 20:4510,65056,305,88323,554,0003,072,0002,371,584
7Feb 7, 2026 20:4510,75251,457,35423,893,0002,986,0002,293,760
8Feb 7, 2026 20:4510,77753,144,51522,952,0003,991,0002,289,664
9Feb 7, 2026 20:4511,62653,266,20624,055,0005,011,0002,478,080