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 listSep 15, 2026 17:30Josu San MartinJosu San MartinScore: 2,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 17:302,78015,700,0995,843,0001,109,0002,117,632
2Sep 15, 2026 17:302,78616,898,0535,855,0001,110,0002,117,632
3Sep 15, 2026 17:302,78815,643,1035,860,0001,111,0002,117,632
4Sep 15, 2026 17:302,78915,686,2915,862,0001,112,0002,117,632
5Sep 15, 2026 17:302,86115,820,1176,027,0001,127,0002,117,632
6Sep 15, 2026 17:302,86515,775,8776,034,0001,129,0002,117,632
7Sep 15, 2026 17:302,86815,875,4126,042,0001,130,0002,117,632
8Sep 15, 2026 17:302,87215,813,2296,050,0001,130,0002,117,632
9Sep 15, 2026 17:302,87815,864,3886,062,0001,134,0002,117,632