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 18:02Elijah KinElijah KinScore: 2,429Success
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 18:022,11215,138,3874,047,0001,234,0002,117,632
2Aug 27, 2026 18:022,17416,304,9584,180,0001,257,0002,117,632
3Aug 27, 2026 18:022,27215,419,2054,431,0001,251,0002,117,632
4Aug 27, 2026 18:022,40715,793,2164,754,0001,264,0002,117,632
5Aug 27, 2026 18:022,42915,802,1134,806,0001,268,0002,117,632
6Aug 27, 2026 18:022,44015,912,7884,844,0001,256,0002,117,632
7Aug 27, 2026 18:022,44015,951,0604,855,0001,247,0002,117,632
8Aug 27, 2026 18:022,46015,944,2634,898,0001,252,0002,117,632
9Aug 27, 2026 18:022,47215,953,6014,936,0001,245,0002,117,632