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 listApr 21, 2026 17:10olliecrowolliecrowScore: 4,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 17:134,81526,977,4519,029,0003,009,0002,543,616
2Apr 21, 2026 17:134,88428,411,2259,159,0003,053,0002,543,616
3Apr 21, 2026 17:134,90634,285,7499,200,0003,066,0002,543,616
4Apr 21, 2026 17:134,96829,899,3618,281,0004,140,0002,347,008
5Apr 21, 2026 17:134,97230,334,8168,288,0004,144,0002,547,712
6Apr 21, 2026 17:134,98932,738,8718,316,0004,158,0002,543,616
7Apr 21, 2026 17:135,02633,598,9577,330,0005,235,0002,535,424
8Apr 21, 2026 17:135,04528,928,11910,511,0002,102,0002,392,064
9Apr 21, 2026 17:135,18227,762,62710,963,0001,993,0002,342,912