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 listAug 29, 2026 14:19Victor MerckléVictor MerckléScore: 1,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 14:201,54512,271,8222,811,0001,053,0002,117,632stderr
2Aug 29, 2026 14:201,56312,354,4832,838,0001,070,0002,117,632stderr
3Aug 29, 2026 14:201,57012,289,6962,866,0001,059,0002,117,632stderr
4Aug 29, 2026 14:201,57612,133,5492,873,0001,068,0002,117,632stderr
5Aug 29, 2026 14:201,57712,283,8802,874,0001,070,0002,117,632stderr
6Aug 29, 2026 14:201,58712,152,3142,886,0001,082,0002,117,632stderr
7Aug 29, 2026 14:201,58812,166,1782,871,0001,101,0002,117,632stderr
8Aug 29, 2026 14:201,66014,584,0642,953,0001,197,0002,117,632stderr
9Aug 29, 2026 14:201,68112,558,9833,082,0001,121,0002,117,632stderr