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:43olliecrowolliecrowScore: 7,968Success
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:557,95446,788,97118,890,000994,0002,260,992
2Mar 12, 2026 03:557,95951,486,18715,918,0003,979,0002,314,240
3Mar 12, 2026 03:557,95948,041,52715,918,0003,979,0002,334,720
4Mar 12, 2026 03:557,96146,061,97416,917,0002,985,0002,318,336
5Mar 12, 2026 03:557,96149,450,38316,917,0002,985,0002,318,336
6Mar 23, 2026 00:437,96449,258,11915,929,0003,982,0002,322,432
7Mar 12, 2026 03:557,96849,339,35017,928,0001,992,0002,355,200
8Mar 23, 2026 00:437,99649,852,83915,993,0003,998,0002,273,280
9Mar 12, 2026 03:558,01650,531,43917,035,0003,006,0002,342,912
10Mar 12, 2026 03:558,02850,017,48617,061,0003,010,0002,338,816
11Mar 12, 2026 03:558,07640,362,67716,153,0004,038,0002,306,048
12Mar 23, 2026 00:438,16446,433,40717,349,0003,061,0002,326,528