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:53KeefeKeefeScore: 20,603Success
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:5320,37778,086,51345,948,0004,994,0002,314,240
2Apr 19, 2025 01:5320,38978,510,42345,975,0004,997,0002,498,560
3Apr 19, 2025 01:5320,49583,607,31847,219,0004,018,0002,383,872
4Apr 19, 2025 01:5320,50577,503,47347,243,0004,020,0002,314,240
5Apr 19, 2025 01:5320,60375,729,97946,458,0005,049,0002,387,968
6Apr 19, 2025 01:5320,67485,574,03247,711,0003,975,0002,535,424
7Apr 19, 2025 01:5320,81282,659,92846,026,0006,003,0002,273,280
8Apr 19, 2025 01:5320,92884,834,53647,290,0005,030,0002,265,088
9Apr 19, 2025 01:5320,93183,061,42550,316,0002,012,0002,502,656