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 4, 2026 22:48olliecrowolliecrowScore: 3,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 22:523,86827,448,4247,314,0002,356,0002,404,352
2May 4, 2026 22:523,94331,085,9537,398,0002,461,0002,396,160
3May 4, 2026 22:523,95426,961,4557,400,0002,487,0002,396,160
4May 4, 2026 22:523,96128,037,6087,431,0002,472,0002,396,160
5May 4, 2026 22:523,96127,516,4207,397,0002,507,0002,396,160
6May 4, 2026 22:523,96928,038,3357,440,0002,484,0002,392,064
7May 4, 2026 22:523,97523,469,6117,581,0002,358,0002,392,064
8May 4, 2026 22:523,97825,182,5507,420,0002,526,0002,396,160
9May 4, 2026 22:524,19627,677,5837,811,0002,681,0002,400,256