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 listMar 19, 2026 22:16Dominique GarmierDominique GarmierScore: 8,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 22:168,69848,446,69719,674,0002,071,0002,277,376
2Mar 19, 2026 22:168,75543,687,69113,928,0007,959,0002,285,568
3Mar 19, 2026 22:168,75654,587,85218,906,0002,985,0002,273,280
4Mar 19, 2026 22:168,75846,257,00116,920,0004,976,0002,285,568
5Mar 19, 2026 22:168,76655,450,44317,931,0003,984,0002,408,448
6Mar 19, 2026 22:168,90444,926,05617,202,0005,059,0002,269,184
7Mar 19, 2026 22:168,93449,770,70817,259,0005,076,0002,310,144
8Mar 19, 2026 22:168,95150,359,88217,292,0005,085,0002,269,184
9Mar 19, 2026 22:168,98447,251,78018,376,0004,083,0002,285,568