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 listSep 25, 2026 21:20Kevin HeaveyKevin HeaveyScore: 2,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 21:212,75699,663,21689,961,0001,003,00020,480
2Sep 25, 2026 21:212,76099,970,77590,084,0001,004,00020,480
3Sep 25, 2026 21:212,763100,377,56390,182,0001,001,00020,480
4Sep 25, 2026 21:212,76599,952,25490,251,0001,006,00020,480
5Sep 25, 2026 21:212,765101,350,80090,274,0001,002,00020,480
6Sep 25, 2026 21:212,76699,991,22290,290,0001,004,00020,480
7Sep 25, 2026 21:212,768100,027,75490,371,0001,003,00020,480
8Sep 25, 2026 21:212,776100,312,53090,608,0001,002,00020,480
9Sep 25, 2026 21:212,988119,063,38697,578,0001,043,00020,480