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 1, 2026 17:51Victor MerckléVictor MerckléScore: 2,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 17:532,50413,761,6754,931,0001,329,0002,113,536
2Jun 1, 2026 17:532,50613,817,9914,936,0001,330,0002,113,536
3Jun 1, 2026 17:532,50813,822,8274,940,0001,330,0002,113,536
4Jun 1, 2026 17:532,55113,919,6225,029,0001,350,0002,113,536
5Jun 1, 2026 17:532,56213,972,0515,078,0001,329,0002,113,536
6Jun 1, 2026 17:532,59614,055,4665,160,0001,331,0002,113,536
7Jun 1, 2026 17:532,59614,058,1815,161,0001,331,0002,113,536
8Jun 1, 2026 17:532,60514,111,4675,186,0001,327,0002,113,536
9Jun 1, 2026 17:532,60613,995,3075,182,0001,334,0002,113,536