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 listNov 27, 2024 15:49Joad NacerJoad NacerScore: 34,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 15:4934,335117,535,68481,845,0003,992,0002,363,392
2Nov 27, 2024 15:4934,341113,437,42282,858,0002,994,0002,519,040
3Nov 27, 2024 15:4934,342119,552,27684,856,000998,0002,502,656