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 19, 2025 01:38etherealetherealScore: 40,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 01:3840,199130,228,96194,468,0006,029,0002,375,680
2Apr 19, 2025 01:3840,343126,111,27292,870,0007,988,0002,531,328
3Apr 19, 2025 01:3840,404127,566,67993,010,0008,000,0002,367,488
4Apr 19, 2025 01:3840,411122,304,64894,026,0007,001,0002,543,616
5Apr 19, 2025 01:3840,551130,848,59595,355,0006,022,0002,527,232
6Apr 19, 2025 01:3840,576123,681,72493,406,0008,034,0002,531,328
7Apr 19, 2025 01:3840,697128,208,17991,768,0009,974,0002,310,144
8Apr 19, 2025 01:3840,840126,247,73391,089,00011,010,0002,379,776
9Apr 19, 2025 01:3841,232132,147,96296,075,0007,005,0002,289,664