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 26, 2026 04:54olliecrowolliecrowScore: 4,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 04:564,79629,525,7908,993,0002,997,0002,355,200
2Apr 26, 2026 04:564,79727,741,4079,995,0001,999,0002,396,160
3Apr 26, 2026 04:564,81230,740,46710,027,0002,005,0002,396,160
4Apr 26, 2026 04:564,81232,177,06910,025,0002,005,0002,396,160
5Apr 26, 2026 04:564,97531,851,87810,366,0002,073,0002,486,272
6Apr 26, 2026 04:565,02631,887,94210,471,0002,094,0002,387,968
7Apr 26, 2026 04:565,11932,017,34010,666,0002,133,0002,396,160
8Apr 26, 2026 04:565,25634,047,3488,087,0005,054,0002,396,160
9Apr 26, 2026 04:565,28232,372,8909,143,0004,063,0002,359,296