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 30, 2026 23:36Tomislav TunkovicTomislav TunkovicScore: 1,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:381,79712,785,4463,178,0001,315,000552,960
2Aug 30, 2026 23:381,79812,867,4013,186,0001,311,000552,960
3Aug 30, 2026 23:381,80012,918,4443,190,0001,310,000552,960
4Aug 30, 2026 23:381,80612,856,3253,281,0001,236,000552,960
5Aug 30, 2026 23:381,80612,833,5983,200,0001,316,000552,960
6Aug 30, 2026 23:381,80712,843,8593,215,0001,304,000552,960
7Aug 30, 2026 23:381,89113,083,8913,435,0001,294,000552,960
8Aug 30, 2026 23:381,95413,202,8683,622,0001,263,000552,960
9Aug 30, 2026 23:381,95813,278,7303,629,0001,268,000552,960