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 listApr 30, 2026 01:26Charles CabergsCharles CabergsScore: 5,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 01:265,75030,536,4299,242,0005,134,0002,473,984
2Apr 30, 2026 01:265,75430,108,90611,304,0003,083,0002,457,600
3Apr 30, 2026 01:265,76830,792,3289,270,0005,150,0002,461,696
4Apr 30, 2026 01:265,77630,238,9467,221,0007,221,0002,457,600
5Apr 30, 2026 01:265,77733,826,05110,317,0004,126,0002,449,408
6Apr 30, 2026 01:265,78137,093,9686,194,0008,259,0002,457,600
7Apr 30, 2026 01:265,85332,347,3349,407,0005,226,0002,453,504
8Apr 30, 2026 01:266,01032,046,3249,016,0006,011,0002,457,600
9Apr 30, 2026 01:266,05035,733,1979,075,0006,050,0002,449,408