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 23:19Josu San MartinJosu San MartinScore: 3,445Success
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 23:203,438124,174,270112,400,0001,054,0002,113,536
2May 14, 2026 23:203,439123,698,697112,452,0001,055,0002,113,536
3May 14, 2026 23:203,442124,239,915112,574,0001,033,0002,113,536
4May 14, 2026 23:203,442123,290,858112,553,0001,047,0002,113,536
5May 14, 2026 23:203,445123,152,246112,658,0001,052,0002,113,536
6May 14, 2026 23:203,448124,708,760112,737,0001,056,0002,113,536
7May 14, 2026 23:203,448124,463,553112,760,0001,048,0002,113,536
8May 14, 2026 23:203,470125,070,408113,468,0001,065,0002,113,536
9May 14, 2026 23:203,526125,181,447115,345,0001,045,0002,113,536