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 4, 2026 19:01olliecrowolliecrowScore: 18,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 19:0118,19369,403,00739,418,0006,064,0002,400,256
2Mar 4, 2026 19:0118,21366,486,54740,474,0005,059,0002,416,640
3Mar 4, 2026 19:0118,22869,558,73739,494,0006,076,0002,404,352
4Mar 4, 2026 19:0118,24268,373,94440,537,0005,067,0002,392,064
5Mar 4, 2026 19:0118,25674,338,55040,570,0005,071,0002,392,064
6Mar 4, 2026 19:0118,28276,825,82740,626,0005,078,0002,408,448
7Mar 4, 2026 19:0118,29072,221,36739,628,0006,096,0002,510,848
8Mar 4, 2026 19:0118,34171,957,06140,869,0004,984,0002,400,256
9Mar 4, 2026 19:0118,43870,435,28842,086,0004,008,0002,404,352