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 listJun 9, 2026 00:21Elijah KinElijah KinScore: 2,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 00:222,37014,944,3494,393,0001,533,0002,117,632
2Jun 9, 2026 00:222,38314,998,7364,427,0001,532,0002,117,632
3Jun 9, 2026 00:222,39415,098,7534,454,0001,532,0002,117,632
4Jun 9, 2026 00:222,44815,254,4994,368,0001,752,0002,117,632
5Jun 9, 2026 00:222,70118,672,4924,584,0002,169,0002,117,632
6Jun 9, 2026 00:222,71815,841,3045,264,0001,532,0002,117,632
7Jun 9, 2026 00:222,83416,181,9225,570,0001,515,0002,117,632
8Jun 9, 2026 00:222,94816,463,3675,060,0002,311,0002,117,632
9Jun 9, 2026 00:222,97716,906,3925,925,0001,519,0002,117,632