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 16, 2026 23:22Jacob McDanielJacob McDanielScore: 9,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:229,75035,427,37320,061,0004,316,0002,113,536
2May 16, 2026 23:229,76935,044,09220,144,0004,279,0002,113,536
3May 16, 2026 23:229,78833,450,20320,097,0004,374,0002,113,536
4May 16, 2026 23:229,83836,476,55320,208,0004,387,0002,113,536
5May 16, 2026 23:229,97436,251,79920,458,0004,478,0002,113,536
6May 16, 2026 23:229,97934,413,01520,655,0004,294,0002,113,536
7May 16, 2026 23:2210,23735,234,33421,156,0004,438,0002,113,536
8May 16, 2026 23:2210,40236,740,32921,508,0004,497,0002,113,536
9May 16, 2026 23:2210,44936,454,67921,646,0004,477,0002,113,536