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 listDec 29, 2025 16:06Josu San MartinJosu San MartinScore: 27,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 16:0627,37994,216,82262,408,0006,039,0002,514,944
2Dec 29, 2025 16:0627,39992,690,19561,447,0007,051,0002,506,752
3Dec 29, 2025 16:0627,41691,408,68462,492,0006,047,0002,347,008