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 1, 2026 05:18Victor MerckléVictor MerckléScore: 1,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 05:191,72212,779,5153,237,0001,070,0002,117,632stderr
2Aug 1, 2026 05:191,73814,062,8443,236,0001,109,0002,117,632stderr
3Aug 1, 2026 05:191,80412,976,1943,378,0001,134,0002,117,632stderr
4Aug 1, 2026 05:191,81213,072,3433,403,0001,129,0002,117,632stderr
5Aug 1, 2026 05:191,81413,656,9933,414,0001,121,0002,117,632stderr
6Aug 1, 2026 05:191,83213,127,3933,441,0001,139,0002,117,632stderr
7Aug 1, 2026 05:191,83412,994,7803,439,0001,148,0002,117,632stderr
8Aug 1, 2026 05:191,83813,658,1123,441,0001,154,0002,117,632stderr
9Aug 1, 2026 05:191,84013,788,2663,464,0001,138,0002,117,632stderr