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 17, 2026 02:04olliecrowolliecrowScore: 4,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 02:044,45728,233,7878,104,0003,039,0002,461,696
2Apr 17, 2026 02:044,48128,032,2908,147,0003,055,0002,363,392
3Apr 17, 2026 02:044,49931,509,28210,226,0001,022,0002,473,984
4Apr 17, 2026 02:044,54431,953,5559,296,0002,065,0002,490,368
5Apr 17, 2026 02:044,67028,177,54810,614,0001,061,0002,482,176
6Apr 17, 2026 02:044,70739,442,55711,767,00002,342,912
7Apr 17, 2026 02:044,71228,850,2429,639,0002,142,0002,482,176
8Apr 17, 2026 02:044,75029,157,0969,897,0001,979,0002,482,176
9Apr 17, 2026 02:044,75428,661,03610,895,000990,0002,367,488