Unique strings Sergey Svistunov

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 listMar 19, 2026 08:38Dominique GarmierDominique GarmierScore: 18,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 08:3818,476637,929,662603,706,0005,997,0002,355,200
2Mar 24, 2026 11:3018,497643,065,387603,395,0006,992,0002,277,376
3Mar 24, 2026 11:3018,517635,416,781604,048,0007,000,0002,289,664
4Mar 19, 2026 08:3818,538636,330,536606,750,0004,997,0002,342,912
5Mar 24, 2026 11:3018,538640,615,128606,748,0004,997,0002,289,664
6Mar 19, 2026 08:3818,639640,685,153610,105,0004,992,0002,338,816