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:49KeefeKeefeScore: 27,674Success
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:4927,01394,500,71259,470,0008,063,0002,351,104
2Apr 19, 2025 01:4927,01592,308,54263,506,0004,032,0002,351,104
3Apr 19, 2025 01:4927,40995,609,68664,493,0004,030,0002,424,832
4Apr 19, 2025 01:4927,65198,572,72066,122,0003,005,0002,301,952
5Apr 19, 2025 01:4927,67495,770,11267,181,0002,005,0002,355,200
6Apr 19, 2025 01:4927,72299,061,87964,283,0005,022,0002,494,464
7Apr 19, 2025 01:4927,83098,802,09367,558,0002,016,0002,351,104
8Apr 19, 2025 01:4927,848101,555,82167,602,0002,017,0002,351,104
9Apr 19, 2025 01:4928,12193,050,24264,277,0006,026,0002,351,104