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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 19:1212,900433,125,181423,158,0002,568,0002,117,632
2May 11, 2026 19:1213,046440,580,170427,970,0002,552,0002,117,632
3May 11, 2026 19:1213,062440,620,129428,412,0002,650,0002,117,632
4May 11, 2026 19:1213,077439,067,777429,456,0002,108,0002,117,632
5May 11, 2026 19:1213,338447,552,355438,145,0002,020,0002,117,632
6May 11, 2026 19:1213,475452,086,867442,093,0002,592,0002,117,632
7May 11, 2026 19:1213,578455,533,681445,446,0002,648,0002,117,632
8May 11, 2026 19:1214,410483,532,841472,882,0002,673,0002,117,632
9May 11, 2026 19:1214,662491,131,284481,158,0002,701,0002,117,632