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 23, 2026 04:22olliecrowolliecrowScore: 4,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 04:254,43926,721,4998,072,0003,027,0002,396,160
2Apr 23, 2026 04:254,45928,856,0496,081,0005,067,0002,465,792
3Apr 23, 2026 04:254,46125,887,4318,112,0003,042,0002,523,136
4Apr 23, 2026 04:254,47030,637,41910,161,0001,016,0002,404,352
5Apr 23, 2026 04:254,47026,392,1109,145,0002,032,0002,383,872
6Apr 23, 2026 04:254,48228,409,8738,150,0003,056,0002,408,448
7Apr 23, 2026 04:254,52731,208,4009,261,0002,058,0002,400,256
8Apr 23, 2026 04:254,68432,801,10410,646,0001,064,0002,392,064
9Apr 23, 2026 04:254,70228,619,2729,619,0002,137,0002,392,064