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 30, 2026 23:14olliecrowolliecrowScore: 3,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 23:183,75725,978,5757,307,0002,087,0002,347,008
2Apr 30, 2026 23:183,75828,310,4066,265,0003,132,0002,461,696
3Apr 30, 2026 23:183,75926,948,3147,311,0002,088,0002,404,352
4Apr 30, 2026 23:183,76432,991,8477,320,0002,091,0002,392,064
5Apr 30, 2026 23:183,76423,827,3818,367,0001,045,0002,355,200
6Apr 30, 2026 23:183,76525,163,6817,322,0002,092,0002,400,256
7Apr 30, 2026 23:183,78029,474,7216,300,0003,150,0002,396,160
8Apr 30, 2026 23:183,79825,697,9537,385,0002,110,0002,392,064
9Apr 30, 2026 23:184,00033,629,1186,001,0004,000,0002,400,256