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:11Victor MerckléVictor MerckléScore: 1,584Success
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:131,57212,337,7852,871,0001,060,0002,117,632stderr
2Aug 29, 2026 14:131,58112,293,2602,885,0001,068,0002,117,632stderr
3Aug 29, 2026 14:131,58312,286,4722,874,0001,085,0002,117,632stderr
4Aug 29, 2026 14:131,58412,124,0082,879,0001,082,0002,117,632stderr
5Aug 29, 2026 14:131,58412,296,3162,882,0001,078,0002,117,632stderr
6Aug 29, 2026 14:131,58412,329,6052,890,0001,072,0002,117,632stderr
7Aug 29, 2026 14:131,58612,358,2852,891,0001,075,0002,117,632stderr
8Aug 29, 2026 14:131,68412,547,6003,098,0001,112,0002,117,632stderr
9Aug 29, 2026 14:131,71312,621,3323,161,0001,122,0002,117,632stderr