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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:143,368122,727,438110,112,0001,037,0002,113,536
2May 13, 2026 19:143,374120,079,232110,310,0001,052,0002,113,536
3May 13, 2026 19:143,376120,524,701110,362,0001,046,0002,113,536
4May 13, 2026 19:143,377120,228,610110,394,0001,057,0002,113,536
5May 13, 2026 19:143,384121,836,325110,648,0001,051,0002,113,536
6May 13, 2026 19:143,387122,391,856110,752,0001,033,0002,113,536
7May 13, 2026 19:143,390122,364,358110,820,0001,055,0002,113,536
8May 13, 2026 19:143,402122,713,863111,231,0001,048,0002,113,536
9May 13, 2026 19:143,481124,368,662113,800,0001,095,0002,113,536