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 21:26Elijah KinElijah KinScore: 2,276Success
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 21:272,19215,303,5894,224,0001,256,0002,117,632
2Aug 27, 2026 21:272,22815,397,0044,288,0001,283,0002,117,632
3Aug 27, 2026 21:272,25015,347,2964,374,0001,251,0002,117,632
4Aug 27, 2026 21:272,26316,149,6304,401,0001,258,0002,117,632
5Aug 27, 2026 21:272,27615,483,4554,439,0001,251,0002,117,632
6Aug 27, 2026 21:272,28615,450,9344,468,0001,248,0002,117,632
7Aug 27, 2026 21:272,31215,640,5414,527,0001,254,0002,117,632
8Aug 27, 2026 21:272,32715,620,2424,553,0001,266,0002,117,632
9Aug 27, 2026 21:272,34815,634,8144,602,0001,269,0002,117,632