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 03:44Josu San MartinJosu San MartinScore: 3,394Success
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 03:453,386122,153,081110,727,0001,041,0002,113,536
2May 14, 2026 03:453,386120,596,473110,709,0001,044,0002,113,536
3May 14, 2026 03:453,390121,092,771110,847,0001,045,0002,113,536
4May 14, 2026 03:453,392120,723,737110,911,0001,044,0002,113,536
5May 14, 2026 03:453,394123,914,460110,953,0001,054,0002,113,536
6May 14, 2026 03:453,394121,747,668110,968,0001,047,0002,113,536
7May 14, 2026 03:453,395121,812,784110,987,0001,056,0002,113,536
8May 14, 2026 03:453,413123,134,572111,615,0001,042,0002,113,536
9May 14, 2026 03:453,421121,756,972111,877,0001,045,0002,113,536