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:32Jacob McDanielJacob McDanielScore: 9,624Success
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:349,46732,556,17619,404,0004,264,0002,113,536
2May 17, 2026 06:349,46934,858,85819,411,0004,263,0002,113,536
3May 17, 2026 06:349,46932,663,43019,463,0004,210,0002,113,536
4May 17, 2026 06:349,51734,020,07419,447,0004,347,0002,113,536
5May 17, 2026 06:349,62434,667,98419,781,0004,281,0002,113,536
6May 17, 2026 06:349,75346,518,28520,238,0004,146,0002,113,536
7May 17, 2026 06:349,87333,542,87220,408,0004,276,0002,113,536
8May 17, 2026 06:3410,18137,303,16821,181,0004,272,0002,113,536
9May 17, 2026 06:3410,35335,944,98821,462,0004,421,0002,113,536