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 16, 2026 21:04Jacob McDanielJacob McDanielScore: 26,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 21:1026,14777,272,77961,210,0004,159,0002,113,536
2May 16, 2026 21:1026,18274,392,67460,830,0004,627,0002,113,536
3May 16, 2026 21:1026,60175,343,15162,388,0004,115,0002,113,536
4May 16, 2026 21:1026,63275,492,57462,335,0004,245,0002,113,536
5May 16, 2026 21:1026,70677,851,32761,899,0004,868,0002,113,536
6May 16, 2026 21:1026,97278,420,21563,310,0004,122,0002,113,536
7May 16, 2026 21:1027,01676,274,61263,331,0004,210,0002,113,536
8May 16, 2026 21:1027,29877,003,21163,419,0004,827,0002,113,536
9May 16, 2026 21:1027,52978,316,09764,727,0004,096,0002,113,536