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 listMay 17, 2026 06:58Jacob McDanielJacob McDanielScore: 7,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:587,22829,071,79415,861,0002,211,0002,113,536
2May 17, 2026 06:587,24527,012,19815,967,0002,147,0002,113,536
3May 17, 2026 06:587,26728,554,09515,998,0002,171,0002,113,536
4May 17, 2026 06:587,27428,631,73016,020,0002,167,0002,113,536
5May 17, 2026 06:587,28228,671,41816,002,0002,203,0002,113,536
6May 17, 2026 06:587,31127,587,68216,136,0002,143,0002,113,536
7May 17, 2026 06:587,31229,565,21616,075,0002,207,0002,113,536
8May 17, 2026 06:587,32328,719,37016,077,0002,232,0002,113,536
9May 17, 2026 06:587,33028,930,29816,142,0002,183,0002,113,536