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 listJun 9, 2026 04:20Elijah KinElijah KinScore: 3,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 04:212,66415,754,3675,181,0001,481,0002,117,632
2Jun 9, 2026 04:212,71115,907,2975,211,0001,568,0002,117,632
3Jun 9, 2026 04:212,91618,414,0305,781,0001,510,0002,117,632
4Jun 9, 2026 04:212,94416,446,6605,189,0002,171,0002,117,632
5Jun 9, 2026 04:213,05616,760,9816,150,0001,492,0002,117,632
6Jun 9, 2026 04:213,06216,790,5136,102,0001,553,0002,117,632
7Jun 9, 2026 04:213,09616,752,9346,252,0001,488,0002,117,632
8Jun 9, 2026 04:213,10116,819,6946,243,0001,511,0002,117,632
9Jun 9, 2026 04:213,22117,154,0936,534,0001,519,0002,117,632