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 listMar 23, 2026 00:45olliecrowolliecrowScore: 7,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 03:577,31539,281,59514,224,0004,064,0002,506,752
2Mar 12, 2026 03:577,33339,748,44714,259,0004,074,0002,473,984
3Mar 12, 2026 03:577,33742,333,68213,247,0005,095,0002,502,656
4Mar 23, 2026 00:457,34144,219,65116,313,0002,039,0002,437,120
5Mar 12, 2026 03:577,36644,246,47214,322,0004,092,0002,441,216
6Mar 12, 2026 03:577,36639,718,15516,369,0002,046,0002,506,752
7Mar 12, 2026 03:577,37338,882,06113,312,0005,120,0002,437,120
8Mar 12, 2026 03:577,37841,668,80214,347,0004,099,0002,297,856
9Mar 23, 2026 00:457,37842,792,75315,370,0003,074,0002,437,120
10Mar 23, 2026 00:457,38147,575,32915,378,0003,075,0002,428,928
11Mar 12, 2026 03:577,38542,223,96916,411,0002,051,0002,465,792
12Mar 12, 2026 03:577,42841,308,50213,412,0005,158,0002,506,752
13Mar 23, 2026 00:457,47845,092,30217,656,0001,038,0002,285,568
14Mar 23, 2026 00:457,48048,830,86415,583,0003,116,0002,424,832
15Mar 23, 2026 00:457,64943,346,68517,110,0002,013,0002,342,912