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 24, 2026 23:44Charles CabergsCharles CabergsScore: 7,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 23:457,29337,505,76112,156,0006,078,0002,531,328
2Apr 24, 2026 23:457,29936,765,36814,194,0004,055,0002,539,520
3Apr 24, 2026 23:457,31532,290,72013,209,0005,080,0002,527,232
4Apr 24, 2026 23:457,31635,755,48212,194,0006,097,0002,367,488
5Apr 24, 2026 23:457,32236,902,30113,222,0005,085,0002,539,520
6Apr 24, 2026 23:457,33830,135,27911,211,0007,134,0002,367,488
7Apr 24, 2026 23:457,35234,044,07713,275,0005,106,0002,531,328
8Apr 24, 2026 23:457,59233,134,15112,987,0005,994,0002,342,912
9Apr 24, 2026 23:457,68637,931,05913,148,0006,068,0002,461,696