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 29, 2026 23:01Victor MerckléVictor MerckléScore: 2,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:032,59214,281,8525,120,0001,362,0002,113,536
2May 29, 2026 23:032,60616,145,2454,231,0002,284,0002,113,536
3May 29, 2026 23:032,61615,384,7595,210,0001,330,0002,113,536
4May 29, 2026 23:032,62017,393,3165,224,0001,328,0002,113,536
5May 29, 2026 23:032,62515,027,0125,240,0001,324,0002,113,536
6May 29, 2026 23:032,63214,404,3295,259,0001,323,0002,113,536
7May 29, 2026 23:032,63814,243,4175,267,0001,328,0002,113,536
8May 29, 2026 23:032,68414,423,6524,432,0002,278,0002,113,536
9May 29, 2026 23:032,68916,359,3534,442,0002,282,0002,113,536