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 16, 2026 13:17marko1597marko1597Score: 1,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:421,64814,059,5482,915,0001,206,0002,121,728stderr
2Aug 16, 2026 13:421,65113,969,4362,919,0001,210,0002,121,728stderr
3Aug 16, 2026 13:421,65213,987,8542,930,0001,200,0002,121,728stderr
4Aug 16, 2026 13:421,65213,955,2952,931,0001,200,0002,121,728stderr
5Aug 16, 2026 13:421,65414,009,2172,932,0001,203,0002,121,728stderr
6Aug 16, 2026 13:421,65914,039,6242,931,0001,217,0002,121,728stderr
7Aug 16, 2026 13:421,67015,248,5182,935,0001,242,0002,121,728stderr
8Aug 16, 2026 13:421,67813,971,6962,972,0001,223,0002,121,728stderr
9Aug 16, 2026 13:421,79314,285,3193,250,0001,234,0002,121,728stderr