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 listNov 17, 2025 06:13Yuriy LyfenkoYuriy LyfenkoScore: 38,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 06:0838,754120,323,77289,893,0006,991,0002,359,296
2Nov 17, 2025 06:0838,763122,177,38590,913,0005,994,0002,486,272
3Nov 17, 2025 06:1338,766121,950,09790,920,0005,994,0002,490,368
4Nov 17, 2025 06:0838,782122,454,22389,958,0006,996,0002,494,464
5Nov 17, 2025 06:0838,784121,308,58989,963,0006,997,0002,478,080
6Nov 17, 2025 06:0838,792124,491,10592,980,0003,999,0002,490,368
7Nov 17, 2025 06:1338,825122,886,24290,058,0007,004,0002,416,640
8Nov 17, 2025 06:1038,846127,565,08291,108,0006,007,0002,330,624
9Nov 17, 2025 06:1338,847123,510,75691,111,0006,007,0002,334,720
10Nov 17, 2025 06:0838,856123,026,22991,133,0006,008,0002,519,040
11Nov 17, 2025 06:0838,928126,996,89690,298,0007,023,0002,486,272
12Nov 17, 2025 06:1338,993122,020,60491,453,0006,029,0002,457,600
13Nov 17, 2025 06:1039,006128,415,56892,488,0005,026,0002,486,272
14Nov 17, 2025 06:1039,009121,687,80492,496,0005,027,0002,445,312
15Nov 17, 2025 06:1339,023126,844,72392,530,0005,028,0002,469,888
16Nov 17, 2025 06:0839,041122,109,26092,572,0005,031,0002,351,104
17Nov 17, 2025 06:1339,048120,727,32391,581,0006,038,0002,478,080
18Nov 17, 2025 06:1339,062124,774,70490,608,0007,047,0002,293,760
19Nov 17, 2025 06:0839,118124,112,87692,805,0004,989,0002,482,176
20Nov 17, 2025 06:1339,133122,049,22591,843,0005,989,0002,314,240
21Nov 17, 2025 06:1339,137126,529,49991,853,0005,990,0002,519,040