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 listAug 27, 2026 20:55Elijah KinElijah KinScore: 3,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 20:562,62316,328,1424,420,0002,138,0002,117,632
2Aug 27, 2026 20:562,65416,567,4554,421,0002,215,0002,117,632
3Aug 27, 2026 20:563,03117,268,2205,393,0002,185,0002,117,632
4Aug 27, 2026 20:563,05117,447,0245,450,0002,178,0002,117,632
5Aug 27, 2026 20:563,07517,501,5645,346,0002,343,0002,117,632
6Aug 27, 2026 20:563,07817,418,8315,502,0002,194,0002,117,632
7Aug 27, 2026 20:563,09017,491,6385,535,0002,191,0002,117,632
8Aug 27, 2026 20:563,15418,321,3245,616,0002,269,0002,117,632
9Aug 27, 2026 20:563,15618,335,6725,539,0002,352,0002,117,632