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 1, 2026 12:50Victor MerckléVictor MerckléScore: 4,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 12:534,35618,970,5586,930,0003,960,0002,383,872
2May 1, 2026 12:534,44930,266,4096,068,0005,056,0002,547,712
3May 1, 2026 12:534,70328,886,8407,483,0004,276,0002,560,000
4May 1, 2026 12:534,79133,159,7184,991,0006,988,0002,539,520
5May 1, 2026 12:534,79720,159,0537,996,0003,998,0002,547,712
6May 1, 2026 12:534,82619,908,7477,039,0005,027,0002,560,000
7May 1, 2026 12:534,88220,386,7356,103,0006,103,0002,424,832
8May 1, 2026 12:534,89220,362,5169,173,0003,057,0002,543,616
9May 1, 2026 12:535,09220,863,89611,671,0001,061,0002,338,816