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 29, 2026 11:30olliecrowolliecrowScore: 3,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 11:333,67926,854,8617,155,0002,044,0002,400,256
2Apr 29, 2026 11:333,69028,590,5237,176,0002,050,0002,486,272
3Apr 29, 2026 11:333,70426,780,5048,233,0001,029,0002,400,256
4Apr 29, 2026 11:333,70928,720,5166,182,0003,091,0002,392,064
5Apr 29, 2026 11:333,71226,041,1067,219,0002,062,0002,400,256
6Apr 29, 2026 11:333,72422,767,4806,207,0003,103,0002,400,256
7Apr 29, 2026 11:333,73029,040,3697,254,0002,072,0002,355,200
8Apr 29, 2026 11:333,76026,639,4137,312,0002,089,0002,387,968
9Apr 29, 2026 11:333,81828,011,1978,487,0001,060,0002,400,256