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 19, 2026 16:20Elijah KinElijah KinScore: 10,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 16:2210,17036,478,96322,399,0003,027,0002,113,536
2May 19, 2026 16:2210,17837,056,72723,362,0002,085,0002,113,536
3May 19, 2026 16:2210,18834,709,05822,354,0003,117,0002,113,536
4May 19, 2026 16:2210,21835,319,16622,511,0003,034,0002,113,536
5May 19, 2026 16:2210,23236,913,11022,447,0003,135,0002,113,536
6May 19, 2026 16:2210,39235,320,57822,797,0003,183,0002,113,536
7May 19, 2026 16:2210,56136,350,98623,276,0003,128,0002,113,536
8May 19, 2026 16:2210,62238,404,90423,392,0003,165,0002,113,536
9May 19, 2026 16:2210,63850,290,28223,459,0003,136,0002,117,632