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:52Joad NacerJoad NacerScore: 34,298Success
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:5234,273117,097,39184,674,0001,008,0002,363,392
2Nov 27, 2024 15:5234,298114,139,85183,727,0002,017,0002,441,216
3Nov 27, 2024 15:5234,336115,643,76982,847,0002,994,0002,318,336