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 listMay 13, 2026 19:41Pavel SkripkinPavel SkripkinScore: 11,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:4211,182377,960,747365,946,0003,064,0002,117,632
2May 13, 2026 19:4211,349381,985,126371,460,0003,085,0002,117,632
3May 13, 2026 19:4211,598390,958,227379,607,0003,156,0002,117,632
4May 13, 2026 19:4211,631393,233,765380,779,0003,064,0002,117,632
5May 13, 2026 19:4211,774396,594,495385,528,0003,019,0002,117,632
6May 13, 2026 19:4211,922400,786,456390,276,0003,160,0002,117,632
7May 13, 2026 19:4212,524422,416,561410,096,0003,208,0002,117,632
8May 13, 2026 19:4213,131441,134,222430,339,0003,014,0002,117,632
9May 13, 2026 19:4217,405592,757,247571,358,0003,011,0002,117,632