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 13:03M-RochatM-RochatScore: 4,481Success
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 13:034,47420,524,38510,102,0001,083,0002,117,632
2May 22, 2026 13:034,47920,427,76510,114,0001,085,0002,117,632
3May 22, 2026 13:034,48020,397,66310,116,0001,084,0002,117,632
4May 22, 2026 13:034,48120,445,42310,119,0001,085,0002,117,632
5May 22, 2026 13:034,48120,498,66110,120,0001,084,0002,117,632
6May 22, 2026 13:034,48320,364,14910,126,0001,083,0002,117,632
7May 22, 2026 13:034,48423,382,41710,127,0001,085,0002,117,632
8May 22, 2026 13:034,48820,454,33210,137,0001,085,0002,121,728
9May 22, 2026 13:034,50122,836,13010,168,0001,086,0002,117,632