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 listOct 17, 2026 04:20e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 04:2003,649,453,4383,637,559,0001,006,0002,113,536expected "1021209 ", got "783059 "
2Oct 17, 2026 04:2003,656,847,4093,644,953,0001,009,0002,113,536expected "1022747 ", got "784004 "
3Oct 17, 2026 04:2003,651,143,6073,639,214,0001,001,0002,113,536expected "1021782 ", got "783746 "