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 listMay 29, 2026 06:05Elijah KinElijah KinScore: 7,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 06:057,49928,394,13115,361,0003,387,0002,113,536
2May 29, 2026 06:057,52429,710,10415,382,0003,429,0002,113,536
3May 29, 2026 06:057,54030,226,84715,438,0003,413,0002,113,536
4May 29, 2026 06:057,54131,207,57415,449,0003,405,0002,113,536
5May 29, 2026 06:057,58131,733,53315,558,0003,395,0002,113,536
6May 29, 2026 06:057,66632,289,05015,774,0003,393,0002,113,536
7May 29, 2026 06:058,06032,396,23716,773,0003,378,0002,113,536
8May 29, 2026 06:058,06430,489,78415,859,0004,303,0002,113,536
9May 29, 2026 06:058,10131,381,68616,828,0003,426,0002,113,536