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 5, 2026 01:15olliecrowolliecrowScore: 3,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 01:173,70725,688,6107,079,0002,190,0002,387,968
2May 5, 2026 01:173,72431,433,3978,086,0001,224,0002,404,352
3May 5, 2026 01:173,73226,429,6627,062,0002,268,0002,404,352
4May 5, 2026 01:173,82433,786,2067,389,0002,173,0002,396,160
5May 5, 2026 01:173,83425,243,7437,279,0002,306,0002,400,256
6May 5, 2026 01:173,92028,446,9447,450,0002,350,0002,396,160
7May 5, 2026 01:173,92526,412,0057,404,0002,410,0002,400,256
8May 5, 2026 01:173,96925,846,0827,456,0002,468,0002,396,160
9May 5, 2026 01:174,03228,033,8377,521,0002,559,0002,383,872