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 6, 2026 23:16Elijah KinElijah KinScore: 2,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 23:182,26014,911,6924,536,0001,116,0002,117,632
2Jun 6, 2026 23:182,26214,675,7194,538,0001,117,0002,117,632
3Jun 6, 2026 23:182,32614,859,7744,581,0001,235,0002,117,632
4Jun 6, 2026 23:182,37915,025,2684,835,0001,114,0002,117,632
5Jun 6, 2026 23:182,42715,199,6054,955,0001,114,0002,117,632
6Jun 6, 2026 23:182,44415,127,5125,011,0001,101,0002,117,632
7Jun 6, 2026 23:182,48415,215,2005,111,0001,100,0002,117,632
8Jun 6, 2026 23:182,51615,287,8395,187,0001,103,0002,117,632
9Jun 6, 2026 23:182,59615,494,4235,248,0001,244,0002,117,632