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 listApr 22, 2026 20:41Dominique GarmierDominique GarmierScore: 8,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 20:428,51138,143,66315,199,0006,079,0002,543,616
2Apr 22, 2026 20:428,52840,840,50417,261,0004,061,0002,535,424
3Apr 22, 2026 20:428,54635,870,37515,261,0006,104,0002,523,136
4Apr 22, 2026 20:428,55141,686,32915,271,0006,108,0002,322,432
5Apr 22, 2026 20:428,56737,525,13317,339,0004,079,0002,527,232
6Apr 22, 2026 20:428,58539,839,67517,376,0004,088,0002,523,136
7Apr 22, 2026 20:428,60741,905,97918,444,0003,074,0002,445,312
8Apr 22, 2026 20:428,62541,601,87117,456,0004,107,0002,355,200
9Apr 22, 2026 20:428,65938,240,57218,556,0003,092,0002,527,232