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:20Josu San MartinJosu San MartinScore: 2,811Success
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:212,75915,558,3335,788,0001,110,0002,117,632
2Sep 15, 2026 20:212,76015,593,6745,792,0001,110,0002,117,632
3Sep 15, 2026 20:212,76315,384,1395,797,0001,112,0002,117,632
4Sep 15, 2026 20:212,80415,785,2785,896,0001,115,0002,117,632
5Sep 15, 2026 20:212,81115,678,1815,912,0001,117,0002,117,632
6Sep 15, 2026 20:212,84215,751,4315,979,0001,128,0002,117,632
7Sep 15, 2026 20:212,84215,758,2435,979,0001,128,0002,117,632
8Sep 15, 2026 20:212,84515,753,9195,984,0001,130,0002,117,632
9Sep 15, 2026 20:212,84815,662,8485,991,0001,130,0002,117,632