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 listJul 21, 2023 22:27Mikhail ShirokovMikhail ShirokovScore: 1,573,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2023 22:271,573,8213,995,170,4813,934,551,34902,297,856
2Jul 21, 2023 22:271,573,9024,009,286,3203,934,754,32902,252,800
3Jul 21, 2023 22:271,575,0593,980,175,2693,937,647,12302,256,896