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 26, 2026 05:27olliecrowolliecrowScore: 4,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:294,14624,947,8058,294,0002,073,0002,396,160
2Apr 26, 2026 05:294,15127,714,9618,303,0002,075,0002,396,160
3Apr 26, 2026 05:294,15227,540,6898,305,0002,076,0002,392,064
4Apr 26, 2026 05:294,16828,370,5277,295,0003,126,0002,392,064
5Apr 26, 2026 05:294,19930,143,4718,399,0002,099,0002,392,064
6Apr 26, 2026 05:294,20830,209,3589,470,0001,052,0002,396,160
7Apr 26, 2026 05:294,23226,402,2299,523,0001,058,0002,400,256
8Apr 26, 2026 05:294,27233,182,8799,612,0001,068,0002,383,872
9Apr 26, 2026 05:294,44425,696,9109,092,0002,020,0002,555,904