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 listFeb 19, 2025 20:48Ian MckibbenIan MckibbenScore: 324,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2025 20:48324,043837,205,691809,108,0001,000,0002,273,280
2Feb 19, 2025 20:48324,047835,487,661809,118,0001,000,0002,281,472
3Feb 19, 2025 20:48324,055832,525,846809,139,000998,0002,535,424
4Feb 19, 2025 20:48324,072830,384,132809,182,000998,0002,355,200
5Feb 19, 2025 20:48324,084838,812,808809,210,000999,0002,535,424
6Feb 19, 2025 20:48324,227839,921,113809,568,000999,0002,457,600
7Feb 19, 2025 20:48324,227833,505,526810,567,00002,273,280
8Feb 19, 2025 20:48324,234838,492,042809,586,000999,0002,535,424
9Feb 19, 2025 20:48324,346841,390,833809,865,000999,0002,273,280