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 listJan 1, 2026 21:15Josu San MartinJosu San MartinScore: 11,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 21:1511,24655,232,95820,083,0008,033,0002,314,240
2Jan 1, 2026 21:1511,29855,367,52819,166,0009,078,0002,457,600
3Jan 1, 2026 21:1511,33251,388,12723,271,0005,059,0002,318,336