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 17, 2026 18:34Jacob McDanielJacob McDanielScore: 3,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 18:343,45017,807,3227,464,0001,163,0002,117,632
2May 17, 2026 18:343,45819,462,3447,476,0001,169,0002,117,632
3May 17, 2026 18:343,46617,860,3077,478,0001,189,0002,117,632
4May 17, 2026 18:343,46818,680,6837,462,0001,208,0002,113,536
5May 17, 2026 18:343,52520,575,3437,574,0001,239,0002,117,632
6May 17, 2026 18:343,54119,546,1027,609,0001,245,0002,117,632
7May 17, 2026 18:343,54218,067,7097,605,0001,250,0002,117,632
8May 17, 2026 18:343,54819,985,8317,625,0001,245,0002,117,632
9May 17, 2026 18:343,55618,638,1877,652,0001,238,0002,117,632