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:50KeefeKeefeScore: 26,731Success
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:5026,21288,547,39661,499,0004,032,0002,351,104
2Apr 19, 2025 01:5026,23886,539,02859,540,0006,054,0002,383,872
3Apr 19, 2025 01:5026,27095,140,22062,645,0003,031,0002,539,520
4Apr 19, 2025 01:5026,52094,375,97462,283,0004,018,0002,371,584
5Apr 19, 2025 01:5026,73193,189,50859,846,0006,982,0002,355,200
6Apr 19, 2025 01:5026,831102,307,76662,072,0005,005,0002,289,664
7Apr 19, 2025 01:5027,11694,386,32960,812,0006,978,0002,539,520
8Apr 19, 2025 01:5027,19596,123,69962,989,0004,999,0002,383,872
9Apr 19, 2025 01:5027,29399,053,78463,216,0005,017,0002,285,568