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 14, 2026 01:13Josu San MartinJosu San MartinScore: 3,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 01:143,340121,033,905109,200,0001,046,0002,113,536
2May 14, 2026 01:143,358121,635,304109,795,0001,047,0002,113,536
3May 14, 2026 01:143,361119,690,607109,893,0001,032,0002,117,632
4May 14, 2026 01:143,369120,193,890110,159,0001,049,0002,113,536
5May 14, 2026 01:143,373122,994,682110,285,0001,052,0002,113,536
6May 14, 2026 01:143,387120,580,113110,743,0001,048,0002,113,536
7May 14, 2026 01:143,393121,450,614110,925,0001,052,0002,113,536
8May 14, 2026 01:143,432124,309,203112,231,0001,046,0002,113,536
9May 14, 2026 01:143,461124,756,885113,197,0001,048,0002,113,536