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 00:53Elijah KinElijah KinScore: 2,268Success
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 01:032,01614,059,5313,817,0001,223,0002,117,632
2Jun 10, 2026 01:032,03814,091,5943,853,0001,243,0002,117,632
3Jun 10, 2026 01:032,04114,005,9393,859,0001,245,0002,117,632
4Jun 10, 2026 01:032,26114,685,3814,414,0001,239,0002,117,632
5Jun 10, 2026 01:032,26814,640,7684,413,0001,259,0002,117,632
6Jun 10, 2026 01:032,27914,673,9064,462,0001,236,0002,117,632
7Jun 10, 2026 01:032,29314,575,1614,508,0001,225,0002,117,632
8Jun 10, 2026 01:032,32414,727,8754,710,0001,101,0002,117,632
9Jun 10, 2026 01:032,34414,859,0574,613,0001,249,0002,117,632