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 listSep 15, 2026 20:48Josu San MartinJosu San MartinScore: 2,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 20:482,76415,658,4855,781,0001,129,0002,117,632
2Sep 15, 2026 20:482,76915,578,2535,791,0001,132,0002,117,632
3Sep 15, 2026 20:482,76915,624,5555,794,0001,130,0002,117,632
4Sep 15, 2026 20:482,76915,705,6515,792,0001,132,0002,117,632
5Sep 15, 2026 20:482,77516,853,4755,805,0001,133,0002,117,632
6Sep 15, 2026 20:482,84815,756,9105,971,0001,150,0002,117,632
7Sep 15, 2026 20:482,86015,805,6616,000,0001,150,0002,117,632
8Sep 15, 2026 20:482,86015,549,4015,998,0001,152,0002,117,632
9Sep 15, 2026 20:482,86115,719,9616,000,0001,154,0002,117,632