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 20, 2026 12:15Jacob McDanielJacob McDanielScore: 6,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 12:165,74424,775,3585,451,0008,911,0002,117,632
2May 20, 2026 12:165,76625,890,4285,478,0008,937,0002,117,632
3May 20, 2026 12:165,86125,636,6565,804,0008,850,0002,117,632
4May 20, 2026 12:166,03326,578,4366,096,0008,987,0002,117,632
5May 20, 2026 12:166,07426,538,7556,268,0008,918,0002,117,632
6May 20, 2026 12:166,09325,548,3586,318,0008,916,0002,113,536
7May 20, 2026 12:166,15925,340,4436,455,0008,944,0002,117,632
8May 20, 2026 12:166,22026,930,7046,551,0009,001,0002,117,632
9May 20, 2026 12:166,27127,952,7676,505,0009,173,0002,117,632