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 09:53M-RochatM-RochatScore: 4,568Success
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 09:534,54520,675,12010,274,0001,089,0002,121,728
2May 22, 2026 09:534,55820,789,90710,307,0001,090,0002,117,632
3May 22, 2026 09:534,56020,739,66310,311,0001,090,0002,117,632
4May 22, 2026 09:534,56320,686,62710,319,0001,090,0002,117,632
5May 22, 2026 09:534,56820,695,59810,333,0001,088,0002,117,632
6May 22, 2026 09:534,57520,970,78710,347,0001,092,0002,117,632
7May 22, 2026 09:534,69421,054,51210,639,0001,098,0002,117,632
8May 22, 2026 09:534,70021,621,91010,652,0001,099,0002,117,632
9May 22, 2026 09:534,70623,826,30010,668,0001,097,0002,117,632