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 10, 2026 02:01Elijah KinElijah KinScore: 2,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 02:022,03714,065,3623,857,0001,236,0002,117,632
2Jun 10, 2026 02:022,04214,172,6863,847,0001,258,0002,117,632
3Jun 10, 2026 02:022,09814,286,8214,116,0001,130,0002,117,632
4Jun 10, 2026 02:022,21614,555,6954,397,0001,143,0002,117,632
5Jun 10, 2026 02:022,23814,551,6584,357,0001,238,0002,117,632
6Jun 10, 2026 02:022,25714,601,8924,381,0001,263,0002,117,632
7Jun 10, 2026 02:022,27415,790,4444,438,0001,248,0002,117,632
8Jun 10, 2026 02:022,28014,686,0574,458,0001,244,0002,117,632
9Jun 10, 2026 02:022,34014,943,2664,620,0001,231,0002,117,632