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 22, 2026 12:55M-RochatM-RochatScore: 4,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 12:554,40620,224,4509,936,0001,081,0002,117,632
2May 22, 2026 12:554,47720,418,68810,107,0001,086,0002,117,632
3May 22, 2026 12:554,48020,385,26510,117,0001,085,0002,117,632
4May 22, 2026 12:554,48520,354,83810,128,0001,086,0002,117,632
5May 22, 2026 12:554,48720,383,71310,130,0001,088,0002,117,632
6May 22, 2026 12:554,48920,370,18010,137,0001,086,0002,117,632
7May 22, 2026 12:554,49220,392,55210,145,0001,086,0002,117,632
8May 22, 2026 12:554,49620,458,60610,156,0001,086,0002,117,632
9May 22, 2026 12:554,49920,573,38910,161,0001,087,0002,117,632