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 14, 2026 15:01limanjun99limanjun99Score: 26,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 15:0122,924781,345,200753,503,0002,998,0002,400,256
2Mar 14, 2026 15:0123,375800,017,461764,378,0006,994,0002,281,472
3Mar 14, 2026 15:0124,004819,995,270788,116,0004,000,0002,367,488
4Mar 14, 2026 15:0124,787843,243,971812,973,0004,999,0002,433,024
5Mar 14, 2026 15:0126,102888,396,412856,354,0004,996,0002,494,464
6Mar 14, 2026 15:0127,392930,479,925898,932,0004,999,0002,486,272
7Mar 14, 2026 15:0128,123956,991,116923,063,0004,994,0002,514,944
8Mar 14, 2026 15:0128,949983,071,669950,336,0004,996,0002,514,944
9Mar 14, 2026 15:0132,9871,121,878,0501,081,597,0006,990,0002,281,472