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 10:23Victor MerckléVictor MerckléScore: 2,645Success
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 10:242,63314,513,1845,236,0001,347,0002,113,536
2May 29, 2026 10:242,63414,188,3455,238,0001,347,0002,113,536
3May 29, 2026 10:242,64014,911,4855,248,0001,352,0002,113,536
4May 29, 2026 10:242,64416,075,8335,259,0001,351,0002,113,536
5May 29, 2026 10:242,64514,234,0055,264,0001,350,0002,113,536
6May 29, 2026 10:242,68814,490,9225,360,0001,362,0002,113,536
7May 29, 2026 10:242,74516,070,9255,522,0001,341,0002,113,536
8May 29, 2026 10:242,80715,001,1034,699,0002,319,0002,113,536
9May 29, 2026 10:242,80914,752,5694,718,0002,305,0002,113,536