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:49Josu San MartinJosu San MartinScore: 3,491Success
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:503,452123,276,872112,876,0001,047,0002,113,536
2May 14, 2026 23:503,456122,805,599113,022,0001,048,0002,113,536
3May 14, 2026 23:503,457125,266,737113,052,0001,052,0002,113,536
4May 14, 2026 23:503,491125,733,850114,173,0001,050,0002,113,536
5May 14, 2026 23:503,491123,998,629114,169,0001,055,0002,113,536
6May 14, 2026 23:503,495126,246,884114,301,0001,051,0002,113,536
7May 14, 2026 23:503,495126,073,708114,291,0001,046,0002,113,536
8May 14, 2026 23:503,496125,210,844114,345,0001,040,0002,113,536
9May 14, 2026 23:503,503127,746,646114,562,0001,055,0002,113,536