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 listOct 17, 2026 02:50e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 02:5102,802,274,2062,788,696,0002,001,0002,113,536expected "1026238 ", got "987999 "
2Oct 17, 2026 02:5102,816,777,0412,803,136,0002,317,0002,113,536expected "1020676 ", got "983260 "
3Oct 17, 2026 02:5102,774,370,4422,761,040,0002,358,0002,113,536expected "1025175 ", got "987040 "