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 18, 2026 22:38Dominique GarmierDominique GarmierScore: 22,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 22:2322,064758,718,493722,119,0005,992,0002,453,504
2Mar 18, 2026 22:3822,125758,875,540727,130,0002,996,0002,273,280
3Mar 18, 2026 22:2322,767780,892,586746,325,0004,995,0002,265,088
4Mar 18, 2026 22:3822,906785,663,767749,908,0005,991,0002,306,048
5Mar 18, 2026 22:3823,519808,548,288771,134,0004,994,0002,273,280
6Mar 18, 2026 22:2323,954824,979,184786,493,0003,997,0002,461,696