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 listJan 3, 2026 05:41Rajarshi BasuRajarshi BasuScore: 3,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 05:413,273140,785,518104,019,0004,000,0002,441,216
2Jan 3, 2026 05:413,277130,764,005105,152,0003,004,0002,461,696
3Jan 3, 2026 05:413,279136,635,776104,187,0004,007,0002,523,136
4Jan 3, 2026 05:413,287137,927,449104,446,0004,017,0002,297,856
5Jan 3, 2026 05:413,294134,335,358104,699,0003,988,0002,510,848
6Jan 3, 2026 05:413,297135,044,842104,801,0003,992,0002,506,752
7Jan 3, 2026 05:413,324142,900,579106,685,0002,991,0002,514,944
8Jan 3, 2026 05:413,329133,282,413105,862,0003,994,0002,445,312
9Jan 3, 2026 05:413,379145,137,904109,500,0002,009,0002,514,944