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 listMay 1, 2026 04:06olliecrowolliecrowScore: 3,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 04:083,72626,235,2466,211,0003,105,0002,375,680
2May 1, 2026 04:083,73724,534,1907,268,0002,076,0002,379,776
3May 1, 2026 04:083,77226,650,0167,336,0002,096,0002,547,712
4May 1, 2026 04:083,77525,531,9738,391,0001,048,0002,367,488
5May 1, 2026 04:083,90529,785,1457,594,0002,169,0002,367,488
6May 1, 2026 04:083,92626,882,5238,727,0001,090,0002,367,488
7May 1, 2026 04:083,98426,153,2096,973,0002,988,0002,359,296
8May 1, 2026 04:083,98526,337,2136,975,0002,989,0002,355,200
9May 1, 2026 04:084,01133,179,9985,014,0005,014,0002,371,584