Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listAug 15, 2026 21:32Victor MerckléVictor MerckléScore: 4,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 21:344,847145,416,612402,110,0004,560,0002,527,232stderr
2Aug 15, 2026 21:344,855145,672,176401,882,0005,539,0002,502,656stderr
3Aug 15, 2026 21:344,873146,217,533403,232,0005,511,0002,527,232stderr
4Aug 15, 2026 21:344,893146,792,573401,001,0005,673,0002,469,888stderr
5Aug 15, 2026 21:344,957148,715,869409,437,0005,648,0002,514,944stderr
6Aug 15, 2026 21:344,984149,520,323410,604,0005,669,0002,506,752stderr
7Aug 15, 2026 21:344,996149,887,486410,956,0005,599,0002,510,848stderr
8Aug 15, 2026 21:345,010150,317,551414,747,0005,579,0002,514,944stderr
9Aug 15, 2026 21:345,012150,376,955412,520,0005,745,0002,527,232stderr