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 5, 2026 19:14olliecrowolliecrowScore: 34,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 19:1634,619100,776,79684,386,0002,162,0002,408,448
2May 5, 2026 19:1634,664101,569,57584,390,0002,270,0002,404,352
3May 5, 2026 19:1634,677104,484,40384,507,0002,186,0002,416,640
4May 5, 2026 19:1634,746101,921,07884,575,0002,291,0002,404,352
5May 5, 2026 19:1634,757101,114,84584,561,0002,333,0002,412,544
6May 5, 2026 19:1634,758104,854,77784,604,0002,292,0002,408,448
7May 5, 2026 19:1634,769101,875,43784,569,0002,354,0002,420,736
8May 5, 2026 19:1634,772101,001,80484,589,0002,341,0002,408,448
9May 5, 2026 19:1635,059101,955,24585,271,0002,378,0002,404,352