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 09:04marko1597marko1597Score: 1,517Success
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 09:271,48712,107,8482,660,0001,059,0002,113,536
2Aug 16, 2026 09:271,50012,141,2342,728,0001,022,0002,113,536
3Aug 16, 2026 09:271,51612,149,3232,711,0001,079,0002,113,536
4Aug 16, 2026 09:271,51612,151,8482,715,0001,075,0002,113,536
5Aug 16, 2026 09:271,51712,110,0722,714,0001,080,0002,113,536
6Aug 16, 2026 09:271,51812,138,0952,760,0001,037,0002,113,536
7Aug 16, 2026 09:271,52112,058,6542,765,0001,039,0002,113,536
8Aug 16, 2026 09:271,52212,121,5882,771,0001,035,0002,113,536
9Aug 16, 2026 09:271,67112,507,7413,110,0001,068,0002,113,536